/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:46:33,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:46:33,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:46:33,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:46:33,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:46:33,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:46:33,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:46:33,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:46:33,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:46:33,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:46:33,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:46:33,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:46:33,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:46:33,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:46:33,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:46:33,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:46:33,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:46:33,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:46:33,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:46:33,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:46:33,826 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:46:33,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:46:33,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:46:33,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:46:33,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:46:33,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:46:33,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:46:33,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:46:33,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:46:33,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:46:33,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:46:33,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:46:33,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:46:33,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:46:33,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:46:33,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:46:33,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:46:33,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:46:33,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:46:33,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:46:33,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:46:33,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:46:33,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:46:33,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:46:33,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:46:33,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:46:33,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:46:33,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:46:33,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:46:33,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:46:33,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:46:33,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:46:33,850 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:46:33,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:46:33,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:46:33,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:46:33,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:46:33,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:46:33,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:46:33,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:46:33,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:46:33,852 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:46:33,852 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:46:33,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:46:33,852 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:46:33,853 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:46:34,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:46:34,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:46:34,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:46:34,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:46:34,064 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:46:34,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2022-04-08 09:46:34,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e39083e/c276ac0e723f426f9cc50f081fe264f7/FLAGe7b2703fa [2022-04-08 09:46:34,464 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:46:34,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2022-04-08 09:46:34,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e39083e/c276ac0e723f426f9cc50f081fe264f7/FLAGe7b2703fa [2022-04-08 09:46:34,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e39083e/c276ac0e723f426f9cc50f081fe264f7 [2022-04-08 09:46:34,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:46:34,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:46:34,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:46:34,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:46:34,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:46:34,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:46:34" (1/1) ... [2022-04-08 09:46:34,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@188013f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:34, skipping insertion in model container [2022-04-08 09:46:34,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:46:34" (1/1) ... [2022-04-08 09:46:34,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:46:34,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:46:35,073 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-new/half.i[891,904] [2022-04-08 09:46:35,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:46:35,093 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:46:35,104 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-new/half.i[891,904] [2022-04-08 09:46:35,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:46:35,122 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:46:35,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35 WrapperNode [2022-04-08 09:46:35,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:46:35,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:46:35,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:46:35,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:46:35,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (1/1) ... [2022-04-08 09:46:35,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (1/1) ... [2022-04-08 09:46:35,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (1/1) ... [2022-04-08 09:46:35,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (1/1) ... [2022-04-08 09:46:35,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (1/1) ... [2022-04-08 09:46:35,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (1/1) ... [2022-04-08 09:46:35,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (1/1) ... [2022-04-08 09:46:35,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:46:35,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:46:35,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:46:35,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:46:35,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (1/1) ... [2022-04-08 09:46:35,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:46:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:35,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:46:35,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:46:35,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:46:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:46:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:46:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:46:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:46:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:46:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:46:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:46:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:46:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:46:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:46:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:46:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:46:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:46:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:46:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:46:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:46:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:46:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:46:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:46:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:46:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:46:35,285 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:46:35,286 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:46:35,440 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:46:35,455 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:46:35,455 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:46:35,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:46:35 BoogieIcfgContainer [2022-04-08 09:46:35,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:46:35,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:46:35,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:46:35,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:46:35,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:46:34" (1/3) ... [2022-04-08 09:46:35,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1770ad4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:46:35, skipping insertion in model container [2022-04-08 09:46:35,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:46:35" (2/3) ... [2022-04-08 09:46:35,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1770ad4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:46:35, skipping insertion in model container [2022-04-08 09:46:35,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:46:35" (3/3) ... [2022-04-08 09:46:35,480 INFO L111 eAbstractionObserver]: Analyzing ICFG half.i [2022-04-08 09:46:35,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:46:35,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:46:35,517 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:46:35,523 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:46:35,523 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:46:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:46:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:46:35,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:35,548 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:35,549 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 1 times [2022-04-08 09:46:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:35,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2101432686] [2022-04-08 09:46:35,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:46:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 2 times [2022-04-08 09:46:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:35,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419760316] [2022-04-08 09:46:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:35,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:35,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-08 09:46:35,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 09:46:35,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-08 09:46:35,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:35,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-08 09:46:35,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 09:46:35,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-08 09:46:35,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret4 := main(); {25#true} is VALID [2022-04-08 09:46:35,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-08 09:46:35,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {25#true} is VALID [2022-04-08 09:46:35,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 09:46:35,801 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {26#false} is VALID [2022-04-08 09:46:35,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 09:46:35,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 09:46:35,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 09:46:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:35,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:35,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419760316] [2022-04-08 09:46:35,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419760316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:35,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:35,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:46:35,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2101432686] [2022-04-08 09:46:35,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2101432686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:35,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:35,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:46:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006583471] [2022-04-08 09:46:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-08 09:46:35,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:35,820 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), 2 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-08 09:46:35,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:35,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:46:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:46:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:46:35,879 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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), 2 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-08 09:46:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:35,984 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 09:46:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:46:35,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-08 09:46:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-08 09:46:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-08 09:46:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-08 09:46:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-08 09:46:36,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-08 09:46:36,064 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-08 09:46:36,073 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:46:36,074 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:46:36,076 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:46:36,082 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:36,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:46:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:46:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:46:36,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:36,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:36,118 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:36,118 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:36,124 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 09:46:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 09:46:36,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:36,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:36,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:46:36,125 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:46:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:36,129 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 09:46:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 09:46:36,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:36,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:36,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:36,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-08 09:46:36,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-08 09:46:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:36,134 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-08 09:46:36,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-08 09:46:36,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-08 09:46:36,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 09:46:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:46:36,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:36,163 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:36,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:46:36,164 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 1 times [2022-04-08 09:46:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:36,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171209608] [2022-04-08 09:46:36,165 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:46:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 2 times [2022-04-08 09:46:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:36,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866612827] [2022-04-08 09:46:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:36,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(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(9, 2); {161#true} is VALID [2022-04-08 09:46:36,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 09:46:36,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-08 09:46:36,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:36,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(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(9, 2); {161#true} is VALID [2022-04-08 09:46:36,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 09:46:36,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-08 09:46:36,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2022-04-08 09:46:36,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {166#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} is VALID [2022-04-08 09:46:36,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {167#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-08 09:46:36,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {168#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-08 09:46:36,371 INFO L272 TraceCheckUtils]: 8: Hoare triple {168#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {169#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:46:36,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {170#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:46:36,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-08 09:46:36,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-08 09:46:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:36,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866612827] [2022-04-08 09:46:36,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866612827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:36,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:36,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:46:36,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:36,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171209608] [2022-04-08 09:46:36,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171209608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:36,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:36,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:46:36,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282914375] [2022-04-08 09:46:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-08 09:46:36,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:36,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-08 09:46:36,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:36,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:46:36,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:36,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:46:36,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:46:36,391 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-08 09:46:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:36,655 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 09:46:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:46:36,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-08 09:46:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-08 09:46:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-08 09:46:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-08 09:46:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-08 09:46:36,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-08 09:46:36,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:36,695 INFO L225 Difference]: With dead ends: 27 [2022-04-08 09:46:36,695 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 09:46:36,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:46:36,697 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:36,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:46:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 09:46:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-08 09:46:36,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:36,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:36,705 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:36,705 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:36,707 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 09:46:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 09:46:36,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:36,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:36,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 21 states. [2022-04-08 09:46:36,708 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 21 states. [2022-04-08 09:46:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:36,709 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 09:46:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 09:46:36,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:36,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:36,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:36,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 09:46:36,711 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-08 09:46:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:36,711 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 09:46:36,712 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-08 09:46:36,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 09:46:36,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 09:46:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:46:36,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:36,733 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:36,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:46:36,733 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash -505067407, now seen corresponding path program 1 times [2022-04-08 09:46:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:36,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444164363] [2022-04-08 09:46:36,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:36,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash -505067407, now seen corresponding path program 2 times [2022-04-08 09:46:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:36,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259040222] [2022-04-08 09:46:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:36,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:36,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(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(9, 2); {316#true} is VALID [2022-04-08 09:46:36,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-08 09:46:36,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-08 09:46:36,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:36,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(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(9, 2); {316#true} is VALID [2022-04-08 09:46:36,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-08 09:46:36,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-08 09:46:36,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-08 09:46:36,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {321#(= main_~n~0 0)} is VALID [2022-04-08 09:46:36,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {322#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:36,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {323#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:46:36,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {324#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= (+ main_~i~0 (* main_~n~0 2)) (+ (* main_~k~0 2) 1)))} is VALID [2022-04-08 09:46:36,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= (+ main_~i~0 (* main_~n~0 2)) (+ (* main_~k~0 2) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {325#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:36,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {325#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(~i~0 < 2 * ~k~0); {317#false} is VALID [2022-04-08 09:46:36,951 INFO L272 TraceCheckUtils]: 11: Hoare triple {317#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {317#false} is VALID [2022-04-08 09:46:36,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2022-04-08 09:46:36,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2022-04-08 09:46:36,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-08 09:46:36,953 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-08 09:46:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259040222] [2022-04-08 09:46:36,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259040222] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:46:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036084344] [2022-04-08 09:46:36,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:46:36,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:36,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:36,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:46:36,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:46:37,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:46:37,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:37,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:46:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:37,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:37,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-08 09:46:37,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#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(9, 2); {316#true} is VALID [2022-04-08 09:46:37,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-08 09:46:37,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-08 09:46:37,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-08 09:46:37,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {321#(= main_~n~0 0)} is VALID [2022-04-08 09:46:37,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {322#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:37,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {323#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:46:37,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {354#(and (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-08 09:46:37,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {358#(and (<= main_~i~0 1) (<= 1 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:37,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#(and (<= main_~i~0 1) (<= 1 (* main_~k~0 2)))} assume !(~i~0 < 2 * ~k~0); {317#false} is VALID [2022-04-08 09:46:37,166 INFO L272 TraceCheckUtils]: 11: Hoare triple {317#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {317#false} is VALID [2022-04-08 09:46:37,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2022-04-08 09:46:37,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2022-04-08 09:46:37,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-08 09:46:37,167 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-08 09:46:37,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:37,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-08 09:46:37,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2022-04-08 09:46:37,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2022-04-08 09:46:37,288 INFO L272 TraceCheckUtils]: 11: Hoare triple {317#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {317#false} is VALID [2022-04-08 09:46:37,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#(< main_~i~0 (* main_~k~0 2))} assume !(~i~0 < 2 * ~k~0); {317#false} is VALID [2022-04-08 09:46:37,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#(< (+ main_~i~0 1) (* main_~k~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {386#(< main_~i~0 (* main_~k~0 2))} is VALID [2022-04-08 09:46:37,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(< (+ main_~i~0 1) (* main_~k~0 2))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {390#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-08 09:46:37,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} assume !!(~i~0 < 2 * ~k~0); {390#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-08 09:46:37,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {397#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-08 09:46:37,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {316#true} is VALID [2022-04-08 09:46:37,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-08 09:46:37,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-08 09:46:37,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-08 09:46:37,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#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(9, 2); {316#true} is VALID [2022-04-08 09:46:37,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-08 09:46:37,293 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-08 09:46:37,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036084344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:37,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:46:37,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2022-04-08 09:46:37,294 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:37,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444164363] [2022-04-08 09:46:37,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444164363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:37,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:37,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:46:37,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300737954] [2022-04-08 09:46:37,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:37,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-08 09:46:37,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:37,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-08 09:46:37,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:37,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:46:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:46:37,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:46:37,311 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-08 09:46:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:37,533 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 09:46:37,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:46:37,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-08 09:46:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-08 09:46:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 09:46:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-08 09:46:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 09:46:37,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-08 09:46:37,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:37,572 INFO L225 Difference]: With dead ends: 32 [2022-04-08 09:46:37,572 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 09:46:37,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:46:37,573 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:37,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 34 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:46:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 09:46:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-08 09:46:37,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:37,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:37,585 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:37,585 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:37,586 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-08 09:46:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 09:46:37,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:37,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:37,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 21 states. [2022-04-08 09:46:37,588 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 21 states. [2022-04-08 09:46:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:37,589 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-08 09:46:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 09:46:37,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:37,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:37,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:37,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-08 09:46:37,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-08 09:46:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:37,591 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-08 09:46:37,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-08 09:46:37,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-08 09:46:37,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 09:46:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:46:37,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:37,612 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:37,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:46:37,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:37,829 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:37,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1214691282, now seen corresponding path program 1 times [2022-04-08 09:46:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:37,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363513135] [2022-04-08 09:46:37,839 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:37,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:37,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1214691282, now seen corresponding path program 2 times [2022-04-08 09:46:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:37,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498541801] [2022-04-08 09:46:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:37,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:38,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:38,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {587#(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(9, 2); {573#true} is VALID [2022-04-08 09:46:38,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {573#true} assume true; {573#true} is VALID [2022-04-08 09:46:38,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {573#true} {573#true} #60#return; {573#true} is VALID [2022-04-08 09:46:38,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:38,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#(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(9, 2); {573#true} is VALID [2022-04-08 09:46:38,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2022-04-08 09:46:38,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #60#return; {573#true} is VALID [2022-04-08 09:46:38,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret4 := main(); {573#true} is VALID [2022-04-08 09:46:38,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {573#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {578#(= main_~n~0 0)} is VALID [2022-04-08 09:46:38,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {579#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:38,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {579#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:38,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {579#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {580#(and (= main_~i~0 0) (or (<= 1 main_~n~0) (<= main_~k~0 main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 1)))} is VALID [2022-04-08 09:46:38,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#(and (= main_~i~0 0) (or (<= 1 main_~n~0) (<= main_~k~0 main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {581#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:38,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {581#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} assume !!(~i~0 < 2 * ~k~0); {582#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:38,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {582#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {582#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:38,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {583#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-08 09:46:38,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {583#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} assume !(~i~0 < 2 * ~k~0); {584#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} is VALID [2022-04-08 09:46:38,082 INFO L272 TraceCheckUtils]: 14: Hoare triple {584#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {585#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:46:38,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {586#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:46:38,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {586#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {574#false} is VALID [2022-04-08 09:46:38,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#false} assume !false; {574#false} is VALID [2022-04-08 09:46:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:38,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498541801] [2022-04-08 09:46:38,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498541801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:46:38,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493442413] [2022-04-08 09:46:38,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:46:38,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:38,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:38,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:46:38,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:46:38,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:46:38,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:38,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 09:46:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:38,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:38,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2022-04-08 09:46:38,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {573#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(9, 2); {573#true} is VALID [2022-04-08 09:46:38,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2022-04-08 09:46:38,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #60#return; {573#true} is VALID [2022-04-08 09:46:38,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret4 := main(); {573#true} is VALID [2022-04-08 09:46:38,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {573#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {578#(= main_~n~0 0)} is VALID [2022-04-08 09:46:38,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {579#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:38,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {579#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:38,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {579#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {615#(and (= main_~i~0 0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-08 09:46:38,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {615#(and (= main_~i~0 0) (= (+ (- 1) main_~n~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {619#(and (= main_~i~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-08 09:46:38,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {619#(and (= main_~i~0 1) (= (+ (- 1) main_~n~0) 0))} assume !!(~i~0 < 2 * ~k~0); {623#(and (= main_~i~0 1) (= (+ (- 1) main_~n~0) 0) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:38,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#(and (= main_~i~0 1) (= (+ (- 1) main_~n~0) 0) (< main_~i~0 (* main_~k~0 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {623#(and (= main_~i~0 1) (= (+ (- 1) main_~n~0) 0) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:38,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#(and (= main_~i~0 1) (= (+ (- 1) main_~n~0) 0) (< main_~i~0 (* main_~k~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {630#(and (< 1 (* main_~k~0 2)) (<= main_~i~0 2) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-08 09:46:38,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#(and (< 1 (* main_~k~0 2)) (<= main_~i~0 2) (= (+ (- 1) main_~n~0) 0))} assume !(~i~0 < 2 * ~k~0); {634#(and (< 1 (* main_~k~0 2)) (= (+ (- 1) main_~n~0) 0) (<= (* main_~k~0 2) 2))} is VALID [2022-04-08 09:46:38,500 INFO L272 TraceCheckUtils]: 14: Hoare triple {634#(and (< 1 (* main_~k~0 2)) (= (+ (- 1) main_~n~0) 0) (<= (* main_~k~0 2) 2))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:38,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:38,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {574#false} is VALID [2022-04-08 09:46:38,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#false} assume !false; {574#false} is VALID [2022-04-08 09:46:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:38,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:38,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#false} assume !false; {574#false} is VALID [2022-04-08 09:46:38,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {574#false} is VALID [2022-04-08 09:46:38,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:38,985 INFO L272 TraceCheckUtils]: 14: Hoare triple {658#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:38,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {662#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} assume !(~i~0 < 2 * ~k~0); {658#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:38,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {662#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-08 09:46:38,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {666#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:38,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} assume !!(~i~0 < 2 * ~k~0); {666#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:38,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {677#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {673#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} is VALID [2022-04-08 09:46:38,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {677#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} is VALID [2022-04-08 09:46:38,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {681#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} assume !!(~i~0 < 2 * ~k~0); {681#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:38,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {681#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:38,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {573#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {578#(= main_~n~0 0)} is VALID [2022-04-08 09:46:38,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret4 := main(); {573#true} is VALID [2022-04-08 09:46:38,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #60#return; {573#true} is VALID [2022-04-08 09:46:38,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2022-04-08 09:46:38,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {573#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(9, 2); {573#true} is VALID [2022-04-08 09:46:38,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2022-04-08 09:46:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:38,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493442413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:38,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:46:38,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-04-08 09:46:38,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:38,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363513135] [2022-04-08 09:46:38,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363513135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:38,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:38,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:46:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494165018] [2022-04-08 09:46:38,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 18 [2022-04-08 09:46:38,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:38,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-08 09:46:39,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:39,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:46:39,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:39,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:46:39,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:46:39,015 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-08 09:46:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:39,465 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 09:46:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:46:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 18 [2022-04-08 09:46:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-08 09:46:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-08 09:46:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-08 09:46:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-08 09:46:39,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2022-04-08 09:46:39,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:39,510 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:46:39,510 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 09:46:39,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 09:46:39,511 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:39,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 52 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:46:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 09:46:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-08 09:46:39,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:39,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:39,530 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:39,531 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:39,532 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-08 09:46:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 09:46:39,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:39,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:39,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 23 states. [2022-04-08 09:46:39,533 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 23 states. [2022-04-08 09:46:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:39,534 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-08 09:46:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 09:46:39,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:39,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:39,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:39,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-08 09:46:39,536 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-04-08 09:46:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:39,536 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-08 09:46:39,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-08 09:46:39,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-08 09:46:39,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-08 09:46:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:46:39,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:39,566 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:39,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:46:39,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 09:46:39,781 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash -560316080, now seen corresponding path program 3 times [2022-04-08 09:46:39,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:39,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017467639] [2022-04-08 09:46:39,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:39,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -560316080, now seen corresponding path program 4 times [2022-04-08 09:46:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:39,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068236349] [2022-04-08 09:46:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:39,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#(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(9, 2); {868#true} is VALID [2022-04-08 09:46:39,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-08 09:46:39,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {868#true} {868#true} #60#return; {868#true} is VALID [2022-04-08 09:46:39,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:39,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#(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(9, 2); {868#true} is VALID [2022-04-08 09:46:39,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-08 09:46:39,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #60#return; {868#true} is VALID [2022-04-08 09:46:39,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret4 := main(); {868#true} is VALID [2022-04-08 09:46:39,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {868#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {868#true} is VALID [2022-04-08 09:46:39,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {868#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {873#(= main_~i~0 0)} is VALID [2022-04-08 09:46:39,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(= main_~i~0 0)} assume !!(~i~0 < 2 * ~k~0); {873#(= main_~i~0 0)} is VALID [2022-04-08 09:46:39,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(= main_~i~0 0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {873#(= main_~i~0 0)} is VALID [2022-04-08 09:46:39,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {874#(not (= (* (div main_~i~0 2) 2) main_~i~0))} is VALID [2022-04-08 09:46:39,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(not (= (* (div main_~i~0 2) 2) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {874#(not (= (* (div main_~i~0 2) 2) main_~i~0))} is VALID [2022-04-08 09:46:39,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#(not (= (* (div main_~i~0 2) 2) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {869#false} is VALID [2022-04-08 09:46:39,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {869#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {869#false} is VALID [2022-04-08 09:46:39,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#false} assume !(~i~0 < 2 * ~k~0); {869#false} is VALID [2022-04-08 09:46:39,897 INFO L272 TraceCheckUtils]: 14: Hoare triple {869#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {869#false} is VALID [2022-04-08 09:46:39,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {869#false} ~cond := #in~cond; {869#false} is VALID [2022-04-08 09:46:39,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#false} assume 0 == ~cond; {869#false} is VALID [2022-04-08 09:46:39,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {869#false} assume !false; {869#false} is VALID [2022-04-08 09:46:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068236349] [2022-04-08 09:46:39,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068236349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:46:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755002110] [2022-04-08 09:46:39,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:46:39,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:39,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:39,904 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-08 09:46:39,905 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-08 09:46:39,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:46:39,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:39,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:46:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:39,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:40,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {868#true} is VALID [2022-04-08 09:46:40,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#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(9, 2); {868#true} is VALID [2022-04-08 09:46:40,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-08 09:46:40,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #60#return; {868#true} is VALID [2022-04-08 09:46:40,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret4 := main(); {868#true} is VALID [2022-04-08 09:46:40,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {868#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {868#true} is VALID [2022-04-08 09:46:40,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {868#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {868#true} is VALID [2022-04-08 09:46:40,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {868#true} assume !!(~i~0 < 2 * ~k~0); {868#true} is VALID [2022-04-08 09:46:40,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {868#true} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {903#(= 0 (mod main_~i~0 2))} is VALID [2022-04-08 09:46:40,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {903#(= 0 (mod main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {874#(not (= (* (div main_~i~0 2) 2) main_~i~0))} is VALID [2022-04-08 09:46:40,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(not (= (* (div main_~i~0 2) 2) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {874#(not (= (* (div main_~i~0 2) 2) main_~i~0))} is VALID [2022-04-08 09:46:40,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#(not (= (* (div main_~i~0 2) 2) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {869#false} is VALID [2022-04-08 09:46:40,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {869#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {869#false} is VALID [2022-04-08 09:46:40,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#false} assume !(~i~0 < 2 * ~k~0); {869#false} is VALID [2022-04-08 09:46:40,113 INFO L272 TraceCheckUtils]: 14: Hoare triple {869#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {869#false} is VALID [2022-04-08 09:46:40,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {869#false} ~cond := #in~cond; {869#false} is VALID [2022-04-08 09:46:40,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#false} assume 0 == ~cond; {869#false} is VALID [2022-04-08 09:46:40,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {869#false} assume !false; {869#false} is VALID [2022-04-08 09:46:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:40,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:46:40,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755002110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:40,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:46:40,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-04-08 09:46:40,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:40,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1017467639] [2022-04-08 09:46:40,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1017467639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:40,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:40,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:46:40,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511432945] [2022-04-08 09:46:40,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-04-08 09:46:40,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:40,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:40,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:46:40,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:40,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:46:40,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:46:40,129 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:40,212 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-08 09:46:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:46:40,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-04-08 09:46:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 09:46:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 09:46:40,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-08 09:46:40,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:40,239 INFO L225 Difference]: With dead ends: 38 [2022-04-08 09:46:40,240 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 09:46:40,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:46:40,241 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:40,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:46:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 09:46:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-08 09:46:40,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:40,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,274 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,275 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:40,276 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-08 09:46:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-08 09:46:40,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:40,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:40,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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 27 states. [2022-04-08 09:46:40,281 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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 27 states. [2022-04-08 09:46:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:40,283 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-08 09:46:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-08 09:46:40,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:40,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:40,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:40,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-08 09:46:40,286 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2022-04-08 09:46:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:40,286 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-08 09:46:40,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:40,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-08 09:46:40,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-08 09:46:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:46:40,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:40,322 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:40,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:46:40,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:40,536 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1894086065, now seen corresponding path program 3 times [2022-04-08 09:46:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:40,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213221410] [2022-04-08 09:46:40,543 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:40,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1894086065, now seen corresponding path program 4 times [2022-04-08 09:46:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:40,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471165204] [2022-04-08 09:46:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:40,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:40,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1123#(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(9, 2); {1110#true} is VALID [2022-04-08 09:46:40,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-08 09:46:40,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1110#true} {1110#true} #60#return; {1110#true} is VALID [2022-04-08 09:46:40,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:40,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1123#(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(9, 2); {1110#true} is VALID [2022-04-08 09:46:40,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-08 09:46:40,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #60#return; {1110#true} is VALID [2022-04-08 09:46:40,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret4 := main(); {1110#true} is VALID [2022-04-08 09:46:40,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {1110#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1115#(= main_~n~0 0)} is VALID [2022-04-08 09:46:40,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {1115#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1116#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:40,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {1116#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:40,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1117#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:40,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {1117#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1118#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:40,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {1118#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !!(~i~0 < 2 * ~k~0); {1118#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:40,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {1118#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1118#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:40,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {1118#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1119#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:40,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1119#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1120#(and (<= main_~i~0 (* main_~n~0 2)) (<= (+ main_~n~0 1) main_~k~0))} is VALID [2022-04-08 09:46:40,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {1120#(and (<= main_~i~0 (* main_~n~0 2)) (<= (+ main_~n~0 1) main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1121#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:40,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1122#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:40,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1122#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(~i~0 < 2 * ~k~0); {1111#false} is VALID [2022-04-08 09:46:40,699 INFO L272 TraceCheckUtils]: 17: Hoare triple {1111#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1111#false} is VALID [2022-04-08 09:46:40,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-08 09:46:40,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-08 09:46:40,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-08 09:46:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:40,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:40,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471165204] [2022-04-08 09:46:40,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471165204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:46:40,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128753418] [2022-04-08 09:46:40,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:46:40,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:40,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:40,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:46:40,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 09:46:40,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:46:40,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:40,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 09:46:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:40,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:41,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1110#true} is VALID [2022-04-08 09:46:41,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#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(9, 2); {1110#true} is VALID [2022-04-08 09:46:41,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-08 09:46:41,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #60#return; {1110#true} is VALID [2022-04-08 09:46:41,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret4 := main(); {1110#true} is VALID [2022-04-08 09:46:41,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {1110#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1110#true} is VALID [2022-04-08 09:46:41,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {1110#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1110#true} is VALID [2022-04-08 09:46:41,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} assume !!(~i~0 < 2 * ~k~0); {1110#true} is VALID [2022-04-08 09:46:41,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#true} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1110#true} is VALID [2022-04-08 09:46:41,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1110#true} is VALID [2022-04-08 09:46:41,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {1110#true} assume !!(~i~0 < 2 * ~k~0); {1110#true} is VALID [2022-04-08 09:46:41,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {1110#true} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1160#(not (= 0 (mod main_~i~0 2)))} is VALID [2022-04-08 09:46:41,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#(not (= 0 (mod main_~i~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1164#(not (= (mod (+ main_~i~0 1) 2) 0))} is VALID [2022-04-08 09:46:41,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {1164#(not (= (mod (+ main_~i~0 1) 2) 0))} assume !!(~i~0 < 2 * ~k~0); {1168#(and (not (= (mod (+ main_~i~0 1) 2) 0)) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:41,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {1168#(and (not (= (mod (+ main_~i~0 1) 2) 0)) (< main_~i~0 (* main_~k~0 2)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1168#(and (not (= (mod (+ main_~i~0 1) 2) 0)) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:41,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#(and (not (= (mod (+ main_~i~0 1) 2) 0)) (< main_~i~0 (* main_~k~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1175#(< (div (+ (* (- 1) main_~i~0) 1) (- 2)) main_~k~0)} is VALID [2022-04-08 09:46:41,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#(< (div (+ (* (- 1) main_~i~0) 1) (- 2)) main_~k~0)} assume !(~i~0 < 2 * ~k~0); {1111#false} is VALID [2022-04-08 09:46:41,287 INFO L272 TraceCheckUtils]: 17: Hoare triple {1111#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1111#false} is VALID [2022-04-08 09:46:41,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-08 09:46:41,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-08 09:46:41,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-08 09:46:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:46:41,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:41,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-08 09:46:41,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-08 09:46:41,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-08 09:46:41,548 INFO L272 TraceCheckUtils]: 17: Hoare triple {1111#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1111#false} is VALID [2022-04-08 09:46:41,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#(< (div (+ (* (- 1) main_~i~0) 1) (- 2)) main_~k~0)} assume !(~i~0 < 2 * ~k~0); {1111#false} is VALID [2022-04-08 09:46:41,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {1206#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) main_~k~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1175#(< (div (+ (* (- 1) main_~i~0) 1) (- 2)) main_~k~0)} is VALID [2022-04-08 09:46:41,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {1206#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) main_~k~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1206#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) main_~k~0)} is VALID [2022-04-08 09:46:41,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {1164#(not (= (mod (+ main_~i~0 1) 2) 0))} assume !!(~i~0 < 2 * ~k~0); {1206#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) main_~k~0)} is VALID [2022-04-08 09:46:41,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#(not (= 0 (mod main_~i~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1164#(not (= (mod (+ main_~i~0 1) 2) 0))} is VALID [2022-04-08 09:46:41,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {1110#true} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1160#(not (= 0 (mod main_~i~0 2)))} is VALID [2022-04-08 09:46:41,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {1110#true} assume !!(~i~0 < 2 * ~k~0); {1110#true} is VALID [2022-04-08 09:46:41,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1110#true} is VALID [2022-04-08 09:46:41,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#true} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1110#true} is VALID [2022-04-08 09:46:41,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} assume !!(~i~0 < 2 * ~k~0); {1110#true} is VALID [2022-04-08 09:46:41,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {1110#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1110#true} is VALID [2022-04-08 09:46:41,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {1110#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1110#true} is VALID [2022-04-08 09:46:41,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret4 := main(); {1110#true} is VALID [2022-04-08 09:46:41,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #60#return; {1110#true} is VALID [2022-04-08 09:46:41,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-08 09:46:41,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#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(9, 2); {1110#true} is VALID [2022-04-08 09:46:41,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1110#true} is VALID [2022-04-08 09:46:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:46:41,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128753418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:41,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:46:41,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 16 [2022-04-08 09:46:41,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:41,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213221410] [2022-04-08 09:46:41,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213221410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:41,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:41,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:46:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208588976] [2022-04-08 09:46:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:41,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 21 [2022-04-08 09:46:41,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:41,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 09:46:41,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:41,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:46:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:46:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:46:41,580 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 09:46:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:41,954 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-08 09:46:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:46:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 21 [2022-04-08 09:46:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 09:46:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-08 09:46:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 09:46:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-08 09:46:41,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-08 09:46:41,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:41,990 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:46:41,990 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 09:46:41,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-08 09:46:41,991 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:41,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:46:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 09:46:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-08 09:46:42,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:42,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:42,032 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:42,032 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:42,033 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 09:46:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-08 09:46:42,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:42,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:42,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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 30 states. [2022-04-08 09:46:42,034 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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 30 states. [2022-04-08 09:46:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:42,035 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 09:46:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-08 09:46:42,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:42,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:42,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:42,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-08 09:46:42,037 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2022-04-08 09:46:42,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:42,037 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-08 09:46:42,037 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 09:46:42,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-08 09:46:42,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-08 09:46:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 09:46:42,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:42,072 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:42,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:46:42,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:42,273 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1325219532, now seen corresponding path program 5 times [2022-04-08 09:46:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:42,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2004504372] [2022-04-08 09:46:42,286 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:42,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1325219532, now seen corresponding path program 6 times [2022-04-08 09:46:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:42,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248832724] [2022-04-08 09:46:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:42,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:42,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:42,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {1473#(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(9, 2); {1456#true} is VALID [2022-04-08 09:46:42,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {1456#true} assume true; {1456#true} is VALID [2022-04-08 09:46:42,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1456#true} {1456#true} #60#return; {1456#true} is VALID [2022-04-08 09:46:42,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1473#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:42,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1473#(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(9, 2); {1456#true} is VALID [2022-04-08 09:46:42,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2022-04-08 09:46:42,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #60#return; {1456#true} is VALID [2022-04-08 09:46:42,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret4 := main(); {1456#true} is VALID [2022-04-08 09:46:42,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {1456#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1461#(= main_~n~0 0)} is VALID [2022-04-08 09:46:42,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {1461#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1462#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:42,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {1462#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {1462#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:42,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {1462#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1463#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:42,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {1463#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1464#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:42,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {1464#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !!(~i~0 < 2 * ~k~0); {1464#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:42,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {1464#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1464#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:42,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {1464#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1465#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:42,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1465#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:42,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1466#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-08 09:46:42,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {1466#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1467#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:42,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {1467#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} assume !!(~i~0 < 2 * ~k~0); {1468#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:42,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {1468#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1468#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:42,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {1468#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1469#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-08 09:46:42,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {1469#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} assume !(~i~0 < 2 * ~k~0); {1470#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} is VALID [2022-04-08 09:46:42,551 INFO L272 TraceCheckUtils]: 20: Hoare triple {1470#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:46:42,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1472#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:46:42,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {1472#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1457#false} is VALID [2022-04-08 09:46:42,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2022-04-08 09:46:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:42,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248832724] [2022-04-08 09:46:42,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248832724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:46:42,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208423720] [2022-04-08 09:46:42,553 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:46:42,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:42,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:42,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:46:42,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 09:46:42,616 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 09:46:42,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:42,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 09:46:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:42,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:43,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2022-04-08 09:46:43,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1456#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(9, 2); {1456#true} is VALID [2022-04-08 09:46:43,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2022-04-08 09:46:43,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #60#return; {1456#true} is VALID [2022-04-08 09:46:43,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret4 := main(); {1456#true} is VALID [2022-04-08 09:46:43,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1456#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1461#(= main_~n~0 0)} is VALID [2022-04-08 09:46:43,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {1461#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1462#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:43,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {1462#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {1462#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:43,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {1462#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1463#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:43,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {1463#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1504#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:43,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {1504#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {1504#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:43,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1504#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:43,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {1504#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1514#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:43,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {1518#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:43,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {1518#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1) (< main_~i~0 (* main_~k~0 2)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1522#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 2) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:43,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {1522#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 2) (< main_~i~0 (* main_~k~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1526#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< 2 (* main_~k~0 2)) (<= main_~i~0 3))} is VALID [2022-04-08 09:46:43,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {1526#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< 2 (* main_~k~0 2)) (<= main_~i~0 3))} assume !!(~i~0 < 2 * ~k~0); {1526#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< 2 (* main_~k~0 2)) (<= main_~i~0 3))} is VALID [2022-04-08 09:46:43,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {1526#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< 2 (* main_~k~0 2)) (<= main_~i~0 3))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1526#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< 2 (* main_~k~0 2)) (<= main_~i~0 3))} is VALID [2022-04-08 09:46:43,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< 2 (* main_~k~0 2)) (<= main_~i~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1536#(and (<= main_~n~0 2) (<= 2 main_~n~0) (<= main_~i~0 4) (< 2 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:43,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {1536#(and (<= main_~n~0 2) (<= 2 main_~n~0) (<= main_~i~0 4) (< 2 (* main_~k~0 2)))} assume !(~i~0 < 2 * ~k~0); {1540#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< 2 (* main_~k~0 2)) (<= (* main_~k~0 2) 4))} is VALID [2022-04-08 09:46:43,254 INFO L272 TraceCheckUtils]: 20: Hoare triple {1540#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< 2 (* main_~k~0 2)) (<= (* main_~k~0 2) 4))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1544#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:43,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {1544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:43,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {1548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1457#false} is VALID [2022-04-08 09:46:43,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2022-04-08 09:46:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:43,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:43,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2022-04-08 09:46:43,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {1548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1457#false} is VALID [2022-04-08 09:46:43,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {1544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:43,939 INFO L272 TraceCheckUtils]: 20: Hoare triple {1564#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1544#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:43,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} assume !(~i~0 < 2 * ~k~0); {1564#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:43,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {1572#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1568#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-08 09:46:43,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {1572#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1572#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:43,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} assume !!(~i~0 < 2 * ~k~0); {1572#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:43,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#(or (= main_~n~0 main_~k~0) (< main_~k~0 0) (< (+ main_~i~0 2) (* main_~k~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1572#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:43,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {1586#(or (= main_~k~0 (+ main_~n~0 1)) (< main_~k~0 0) (< (+ main_~i~0 2) (* main_~k~0 2)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1582#(or (= main_~n~0 main_~k~0) (< main_~k~0 0) (< (+ main_~i~0 2) (* main_~k~0 2)))} is VALID [2022-04-08 09:46:43,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {1590#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} assume !!(~i~0 < 2 * ~k~0); {1586#(or (= main_~k~0 (+ main_~n~0 1)) (< main_~k~0 0) (< (+ main_~i~0 2) (* main_~k~0 2)))} is VALID [2022-04-08 09:46:43,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {1594#(and (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1590#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:43,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1594#(and (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1594#(and (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:43,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {1594#(and (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} assume !!(~i~0 < 2 * ~k~0); {1594#(and (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:43,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1604#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1594#(and (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:43,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {1608#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1604#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:43,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {1608#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} assume !!(~i~0 < 2 * ~k~0); {1608#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-08 09:46:43,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {1461#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1608#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-08 09:46:43,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {1456#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1461#(= main_~n~0 0)} is VALID [2022-04-08 09:46:43,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret4 := main(); {1456#true} is VALID [2022-04-08 09:46:43,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #60#return; {1456#true} is VALID [2022-04-08 09:46:43,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2022-04-08 09:46:43,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1456#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(9, 2); {1456#true} is VALID [2022-04-08 09:46:43,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2022-04-08 09:46:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:43,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208423720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:43,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:46:43,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-08 09:46:43,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:43,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2004504372] [2022-04-08 09:46:43,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2004504372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:43,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:43,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 09:46:43,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82215620] [2022-04-08 09:46:43,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:43,955 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 24 [2022-04-08 09:46:43,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:43,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 09:46:43,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:43,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 09:46:43,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 09:46:43,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 09:46:43,978 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 09:46:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:44,618 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 09:46:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 09:46:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 24 [2022-04-08 09:46:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 09:46:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2022-04-08 09:46:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 09:46:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2022-04-08 09:46:44,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 35 transitions. [2022-04-08 09:46:44,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:44,654 INFO L225 Difference]: With dead ends: 37 [2022-04-08 09:46:44,655 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 09:46:44,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1803, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 09:46:44,656 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:44,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:46:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 09:46:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-08 09:46:44,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:44,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:44,706 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:44,706 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:44,707 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-08 09:46:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-08 09:46:44,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:44,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:44,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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 32 states. [2022-04-08 09:46:44,708 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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 32 states. [2022-04-08 09:46:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:44,709 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-08 09:46:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-08 09:46:44,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:44,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:44,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:44,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-08 09:46:44,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2022-04-08 09:46:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:44,711 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-08 09:46:44,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 09:46:44,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-08 09:46:44,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-08 09:46:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 09:46:44,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:44,752 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:44,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 09:46:44,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:44,968 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash 356674989, now seen corresponding path program 7 times [2022-04-08 09:46:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:44,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332672203] [2022-04-08 09:46:44,977 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:44,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash 356674989, now seen corresponding path program 8 times [2022-04-08 09:46:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:44,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773225762] [2022-04-08 09:46:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:44,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:45,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:45,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {1875#(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(9, 2); {1861#true} is VALID [2022-04-08 09:46:45,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1861#true} assume true; {1861#true} is VALID [2022-04-08 09:46:45,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1861#true} {1861#true} #60#return; {1861#true} is VALID [2022-04-08 09:46:45,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {1861#true} call ULTIMATE.init(); {1875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:45,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1875#(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(9, 2); {1861#true} is VALID [2022-04-08 09:46:45,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {1861#true} assume true; {1861#true} is VALID [2022-04-08 09:46:45,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1861#true} {1861#true} #60#return; {1861#true} is VALID [2022-04-08 09:46:45,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {1861#true} call #t~ret4 := main(); {1861#true} is VALID [2022-04-08 09:46:45,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {1861#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1866#(= main_~n~0 0)} is VALID [2022-04-08 09:46:45,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {1866#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1867#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:45,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {1867#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {1867#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:45,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {1867#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1868#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:45,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !!(~i~0 < 2 * ~k~0); {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1870#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:45,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {1870#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1870#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:45,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {1870#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1871#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {1871#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !!(~i~0 < 2 * ~k~0); {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {1869#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1870#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:45,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {1870#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1872#(and (<= main_~i~0 (* main_~n~0 2)) (<= (+ main_~n~0 1) main_~k~0))} is VALID [2022-04-08 09:46:45,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {1872#(and (<= main_~i~0 (* main_~n~0 2)) (<= (+ main_~n~0 1) main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1873#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {1873#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1874#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:45,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {1874#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(~i~0 < 2 * ~k~0); {1862#false} is VALID [2022-04-08 09:46:45,185 INFO L272 TraceCheckUtils]: 23: Hoare triple {1862#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1862#false} is VALID [2022-04-08 09:46:45,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#false} ~cond := #in~cond; {1862#false} is VALID [2022-04-08 09:46:45,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#false} assume 0 == ~cond; {1862#false} is VALID [2022-04-08 09:46:45,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {1862#false} assume !false; {1862#false} is VALID [2022-04-08 09:46:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:46:45,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:45,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773225762] [2022-04-08 09:46:45,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773225762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:46:45,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717030142] [2022-04-08 09:46:45,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:46:45,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:45,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:45,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:46:45,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 09:46:45,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:46:45,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:45,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 09:46:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:45,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:45,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {1861#true} call ULTIMATE.init(); {1861#true} is VALID [2022-04-08 09:46:45,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1861#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(9, 2); {1861#true} is VALID [2022-04-08 09:46:45,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {1861#true} assume true; {1861#true} is VALID [2022-04-08 09:46:45,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1861#true} {1861#true} #60#return; {1861#true} is VALID [2022-04-08 09:46:45,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {1861#true} call #t~ret4 := main(); {1861#true} is VALID [2022-04-08 09:46:45,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {1861#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1866#(= main_~n~0 0)} is VALID [2022-04-08 09:46:45,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {1866#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1867#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:45,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {1867#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {1867#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:45,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {1867#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1868#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:45,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1906#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:45,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {1906#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {1906#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:45,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {1906#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 0) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1906#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:45,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {1906#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1916#(and (= (+ (- 2) main_~i~0) 0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:45,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {1916#(and (= (+ (- 2) main_~i~0) 0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {1916#(and (= (+ (- 2) main_~i~0) 0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:45,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {1916#(and (= (+ (- 2) main_~i~0) 0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1923#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 0) (<= 2 main_~n~0))} is VALID [2022-04-08 09:46:45,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {1923#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 0) (<= 2 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1927#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 0))} is VALID [2022-04-08 09:46:45,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {1927#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 0))} assume !!(~i~0 < 2 * ~k~0); {1927#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 0))} is VALID [2022-04-08 09:46:45,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {1927#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1927#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 0))} is VALID [2022-04-08 09:46:45,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {1927#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1937#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-08 09:46:45,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {1937#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 < 2 * ~k~0); {1941#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} is VALID [2022-04-08 09:46:45,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {1941#(and (<= main_~n~0 2) (<= 2 main_~n~0) (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1945#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} is VALID [2022-04-08 09:46:45,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {1945#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1949#(and (< 4 (* main_~k~0 2)) (<= main_~i~0 5))} is VALID [2022-04-08 09:46:45,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {1949#(and (< 4 (* main_~k~0 2)) (<= main_~i~0 5))} assume !(~i~0 < 2 * ~k~0); {1862#false} is VALID [2022-04-08 09:46:45,551 INFO L272 TraceCheckUtils]: 23: Hoare triple {1862#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1862#false} is VALID [2022-04-08 09:46:45,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#false} ~cond := #in~cond; {1862#false} is VALID [2022-04-08 09:46:45,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#false} assume 0 == ~cond; {1862#false} is VALID [2022-04-08 09:46:45,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {1862#false} assume !false; {1862#false} is VALID [2022-04-08 09:46:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:45,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:45,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {1862#false} assume !false; {1862#false} is VALID [2022-04-08 09:46:45,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#false} assume 0 == ~cond; {1862#false} is VALID [2022-04-08 09:46:45,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#false} ~cond := #in~cond; {1862#false} is VALID [2022-04-08 09:46:45,758 INFO L272 TraceCheckUtils]: 23: Hoare triple {1862#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1862#false} is VALID [2022-04-08 09:46:45,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {1977#(< main_~i~0 (* main_~k~0 2))} assume !(~i~0 < 2 * ~k~0); {1862#false} is VALID [2022-04-08 09:46:45,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {1981#(< (+ main_~i~0 1) (* main_~k~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1977#(< main_~i~0 (* main_~k~0 2))} is VALID [2022-04-08 09:46:45,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {1981#(< (+ main_~i~0 1) (* main_~k~0 2))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1981#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-08 09:46:45,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} assume !!(~i~0 < 2 * ~k~0); {1981#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-08 09:46:45,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-08 09:46:45,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-08 09:46:45,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} assume !!(~i~0 < 2 * ~k~0); {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-08 09:46:45,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-08 09:46:45,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-08 09:46:45,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} assume !!(~i~0 < 2 * ~k~0); {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-08 09:46:45,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-08 09:46:45,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-08 09:46:45,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} assume !!(~i~0 < 2 * ~k~0); {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-08 09:46:45,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-08 09:46:45,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-08 09:46:45,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} assume !!(~i~0 < 2 * ~k~0); {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-08 09:46:45,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {1861#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-08 09:46:45,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1861#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1861#true} is VALID [2022-04-08 09:46:45,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {1861#true} call #t~ret4 := main(); {1861#true} is VALID [2022-04-08 09:46:45,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1861#true} {1861#true} #60#return; {1861#true} is VALID [2022-04-08 09:46:45,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {1861#true} assume true; {1861#true} is VALID [2022-04-08 09:46:45,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1861#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(9, 2); {1861#true} is VALID [2022-04-08 09:46:45,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {1861#true} call ULTIMATE.init(); {1861#true} is VALID [2022-04-08 09:46:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 09:46:45,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717030142] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:45,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:46:45,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 6] total 24 [2022-04-08 09:46:45,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:45,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332672203] [2022-04-08 09:46:45,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332672203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:45,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:45,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:46:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241722998] [2022-04-08 09:46:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:45,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 27 [2022-04-08 09:46:45,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:45,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 09:46:45,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:45,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:46:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:45,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:46:45,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-04-08 09:46:45,793 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 09:46:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:46,131 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 09:46:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:46:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 27 [2022-04-08 09:46:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 09:46:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-08 09:46:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 09:46:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-08 09:46:46,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2022-04-08 09:46:46,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:46,170 INFO L225 Difference]: With dead ends: 36 [2022-04-08 09:46:46,170 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 09:46:46,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2022-04-08 09:46:46,172 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:46,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 48 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:46:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 09:46:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 09:46:46,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:46,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:46,252 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:46,252 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:46,253 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 09:46:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:46:46,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:46,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:46,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 31 states. [2022-04-08 09:46:46,254 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 31 states. [2022-04-08 09:46:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:46,255 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 09:46:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:46:46,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:46,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:46,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:46,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 09:46:46,257 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-04-08 09:46:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:46,257 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 09:46:46,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 09:46:46,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 09:46:46,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:46:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 09:46:46,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:46,291 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:46,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 09:46:46,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:46,496 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1932084970, now seen corresponding path program 9 times [2022-04-08 09:46:46,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:46,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104206250] [2022-04-08 09:46:46,502 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:46,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1932084970, now seen corresponding path program 10 times [2022-04-08 09:46:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:46,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331303252] [2022-04-08 09:46:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:46:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:46,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {2277#(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(9, 2); {2259#true} is VALID [2022-04-08 09:46:46,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-08 09:46:46,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2259#true} {2259#true} #60#return; {2259#true} is VALID [2022-04-08 09:46:46,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:46:46,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {2277#(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(9, 2); {2259#true} is VALID [2022-04-08 09:46:46,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-08 09:46:46,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #60#return; {2259#true} is VALID [2022-04-08 09:46:46,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret4 := main(); {2259#true} is VALID [2022-04-08 09:46:46,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {2259#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2264#(= main_~n~0 0)} is VALID [2022-04-08 09:46:46,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {2264#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {2265#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:46,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {2265#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:46,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2266#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:46,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {2266#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:46,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !!(~i~0 < 2 * ~k~0); {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:46,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:46,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2268#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:46,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {2268#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {2268#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:46,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {2268#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2269#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:46,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {2269#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:46,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !!(~i~0 < 2 * ~k~0); {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:46,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-08 09:46:46,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {2267#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2268#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:46,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {2268#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {2268#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-08 09:46:46,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {2268#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2270#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-08 09:46:46,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {2270#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2271#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:46,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {2271#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} assume !!(~i~0 < 2 * ~k~0); {2272#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:46,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {2272#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2272#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-08 09:46:46,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {2272#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2273#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-08 09:46:46,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {2273#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} assume !(~i~0 < 2 * ~k~0); {2274#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} is VALID [2022-04-08 09:46:46,790 INFO L272 TraceCheckUtils]: 26: Hoare triple {2274#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {2275#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:46:46,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {2275#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2276#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:46:46,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {2276#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2260#false} is VALID [2022-04-08 09:46:46,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-08 09:46:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 09:46:46,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:46,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331303252] [2022-04-08 09:46:46,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331303252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:46:46,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945366765] [2022-04-08 09:46:46,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:46:46,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:46,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:46,794 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:46:46,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 09:46:46,836 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:46:46,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:46,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 09:46:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:46,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:47,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2022-04-08 09:46:47,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2259#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(9, 2); {2259#true} is VALID [2022-04-08 09:46:47,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-08 09:46:47,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #60#return; {2259#true} is VALID [2022-04-08 09:46:47,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret4 := main(); {2259#true} is VALID [2022-04-08 09:46:47,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {2259#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2264#(= main_~n~0 0)} is VALID [2022-04-08 09:46:47,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {2264#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {2265#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:47,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#(and (= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {2265#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:46:47,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#(and (= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2266#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:47,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {2266#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2308#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:47,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {2308#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {2308#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:47,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {2308#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2308#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:47,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {2308#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2318#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:47,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {2318#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} is VALID [2022-04-08 09:46:47,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2325#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 2))} is VALID [2022-04-08 09:46:47,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {2325#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2329#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} is VALID [2022-04-08 09:46:47,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {2329#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} assume !!(~i~0 < 2 * ~k~0); {2329#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} is VALID [2022-04-08 09:46:47,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {2329#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2329#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} is VALID [2022-04-08 09:46:47,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {2329#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2339#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-08 09:46:47,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {2339#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 < 2 * ~k~0); {2339#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 4))} is VALID [2022-04-08 09:46:47,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {2339#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 4))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2346#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= main_~i~0 4))} is VALID [2022-04-08 09:46:47,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {2346#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(and (<= 3 main_~n~0) (= 5 main_~i~0) (<= main_~n~0 3))} is VALID [2022-04-08 09:46:47,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {2350#(and (<= 3 main_~n~0) (= 5 main_~i~0) (<= main_~n~0 3))} assume !!(~i~0 < 2 * ~k~0); {2354#(and (<= 3 main_~n~0) (= 5 main_~i~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:47,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#(and (<= 3 main_~n~0) (= 5 main_~i~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2354#(and (<= 3 main_~n~0) (= 5 main_~i~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-08 09:46:47,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#(and (<= 3 main_~n~0) (= 5 main_~i~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2361#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= main_~i~0 6) (<= main_~n~0 3))} is VALID [2022-04-08 09:46:47,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {2361#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= main_~i~0 6) (<= main_~n~0 3))} assume !(~i~0 < 2 * ~k~0); {2365#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= (* main_~k~0 2) 6) (<= main_~n~0 3))} is VALID [2022-04-08 09:46:47,496 INFO L272 TraceCheckUtils]: 26: Hoare triple {2365#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= (* main_~k~0 2) 6) (<= main_~n~0 3))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:47,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:47,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {2373#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2260#false} is VALID [2022-04-08 09:46:47,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-08 09:46:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:47,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:48,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-08 09:46:48,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {2373#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2260#false} is VALID [2022-04-08 09:46:48,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:48,475 INFO L272 TraceCheckUtils]: 26: Hoare triple {2389#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:48,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {2393#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} assume !(~i~0 < 2 * ~k~0); {2389#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:48,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {2397#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2393#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-08 09:46:48,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {2397#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2397#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:48,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {2404#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} assume !!(~i~0 < 2 * ~k~0); {2397#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-08 09:46:48,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {2408#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2404#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} is VALID [2022-04-08 09:46:48,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {2412#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2408#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} is VALID [2022-04-08 09:46:48,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {2412#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} assume !!(~i~0 < 2 * ~k~0); {2412#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:48,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {2419#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2412#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:48,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {2419#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2419#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:48,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {2419#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} assume !!(~i~0 < 2 * ~k~0); {2419#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:48,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {2429#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 2))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2419#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-08 09:46:48,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {2433#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2429#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 2))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))))} is VALID [2022-04-08 09:46:48,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {2433#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} assume !!(~i~0 < 2 * ~k~0); {2433#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-08 09:46:48,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {2440#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2433#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-08 09:46:48,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {2440#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2440#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-08 09:46:48,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {2440#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} assume !!(~i~0 < 2 * ~k~0); {2440#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-08 09:46:48,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {2450#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2440#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-08 09:46:48,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {2454#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {2450#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-08 09:46:48,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {2454#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} assume !!(~i~0 < 2 * ~k~0); {2454#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} is VALID [2022-04-08 09:46:48,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {2264#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {2454#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} is VALID [2022-04-08 09:46:48,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {2259#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2264#(= main_~n~0 0)} is VALID [2022-04-08 09:46:48,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret4 := main(); {2259#true} is VALID [2022-04-08 09:46:48,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #60#return; {2259#true} is VALID [2022-04-08 09:46:48,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-08 09:46:48,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {2259#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(9, 2); {2259#true} is VALID [2022-04-08 09:46:48,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2022-04-08 09:46:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:48,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945366765] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:48,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:46:48,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 40 [2022-04-08 09:46:48,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104206250] [2022-04-08 09:46:48,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104206250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:48,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:48,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 09:46:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44063309] [2022-04-08 09:46:48,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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 30 [2022-04-08 09:46:48,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:48,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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-08 09:46:48,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:48,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 09:46:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 09:46:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 09:46:48,518 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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-08 09:46:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:48,940 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 09:46:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 09:46:48,941 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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 30 [2022-04-08 09:46:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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-08 09:46:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2022-04-08 09:46:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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-08 09:46:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2022-04-08 09:46:48,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 21 transitions. [2022-04-08 09:46:48,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:48,979 INFO L225 Difference]: With dead ends: 31 [2022-04-08 09:46:48,979 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:46:48,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=2084, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 09:46:48,980 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:48,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:46:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:46:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:46:48,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:48,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:46:48,981 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:46:48,982 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:46:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:48,982 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:46:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:46:48,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:48,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:48,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:46:48,982 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:46:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:48,982 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:46:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:46:48,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:48,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:48,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:48,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:46:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:46:48,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-08 09:46:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:48,983 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:46:48,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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-08 09:46:48,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:46:48,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:46:48,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:48,986 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:46:49,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 09:46:49,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:49,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:46:49,500 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:46:49,500 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:46:49,500 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:46:49,500 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:46:49,500 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:46:49,500 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:46:49,500 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:46:49,500 INFO L878 garLoopResultBuilder]: At program point L30(lines 30 32) the Hoare annotation is: (let ((.cse0 (* main_~n~0 2))) (or (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (< main_~n~0 (+ main_~k~0 1)) (<= .cse1 .cse0))) (and (<= main_~i~0 .cse0) (<= .cse0 main_~i~0) (<= (+ main_~n~0 1) main_~k~0)))) [2022-04-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 36) the Hoare annotation is: true [2022-04-08 09:46:49,501 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (= main_~n~0 0) (= main_~i~0 0)) [2022-04-08 09:46:49,501 INFO L878 garLoopResultBuilder]: At program point L29-2(lines 29 33) the Hoare annotation is: (let ((.cse2 (< main_~n~0 (+ main_~k~0 1))) (.cse0 (* main_~n~0 2))) (or (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) .cse2 (<= .cse1 .cse0))) (let ((.cse3 (+ main_~i~0 2))) (and .cse2 (<= .cse0 .cse3) (<= .cse3 .cse0))))) [2022-04-08 09:46:49,501 INFO L878 garLoopResultBuilder]: At program point L29-3(lines 29 33) the Hoare annotation is: (let ((.cse0 (* main_~n~0 2))) (let ((.cse4 (<= main_~i~0 .cse0))) (let ((.cse2 (< main_~n~0 (+ main_~k~0 1))) (.cse3 (or .cse4 (<= main_~k~0 main_~n~0)))) (or (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) .cse2 .cse3 (<= .cse1 .cse0))) (and (= main_~n~0 0) (= main_~i~0 0)) (and .cse4 .cse2 (<= .cse0 main_~i~0) .cse3))))) [2022-04-08 09:46:49,501 INFO L878 garLoopResultBuilder]: At program point L29-4(lines 29 33) the Hoare annotation is: (or (and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0)) (and (not (= main_~k~0 0)) (<= main_~k~0 0))) [2022-04-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 36) the Hoare annotation is: true [2022-04-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 36) the Hoare annotation is: true [2022-04-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: true [2022-04-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:46:49,501 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-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:46:49,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:46:49,502 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:46:49,502 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-08 09:46:49,502 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:46:49,502 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-08 09:46:49,502 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:46:49,502 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:46:49,502 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:46:49,504 INFO L719 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2] [2022-04-08 09:46:49,505 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:46:49,507 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:46:49,507 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:46:49,517 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:46:49,518 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:46:49,518 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:46:49,518 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:46:49,519 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:46:49,530 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:46:49,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:46:49 BoogieIcfgContainer [2022-04-08 09:46:49,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:46:49,540 INFO L158 Benchmark]: Toolchain (without parser) took 14640.10ms. Allocated memory was 168.8MB in the beginning and 251.7MB in the end (delta: 82.8MB). Free memory was 116.8MB in the beginning and 175.2MB in the end (delta: -58.4MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. [2022-04-08 09:46:49,540 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 168.8MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:46:49,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.27ms. Allocated memory was 168.8MB in the beginning and 208.7MB in the end (delta: 39.8MB). Free memory was 116.6MB in the beginning and 185.5MB in the end (delta: -68.9MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-08 09:46:49,540 INFO L158 Benchmark]: Boogie Preprocessor took 35.85ms. Allocated memory is still 208.7MB. Free memory was 185.3MB in the beginning and 183.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:46:49,541 INFO L158 Benchmark]: RCFGBuilder took 294.45ms. Allocated memory is still 208.7MB. Free memory was 183.8MB in the beginning and 171.9MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:46:49,541 INFO L158 Benchmark]: TraceAbstraction took 14080.06ms. Allocated memory was 208.7MB in the beginning and 251.7MB in the end (delta: 43.0MB). Free memory was 171.6MB in the beginning and 175.2MB in the end (delta: -3.7MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2022-04-08 09:46:49,542 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.17ms. Allocated memory is still 168.8MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.27ms. Allocated memory was 168.8MB in the beginning and 208.7MB in the end (delta: 39.8MB). Free memory was 116.6MB in the beginning and 185.5MB in the end (delta: -68.9MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.85ms. Allocated memory is still 208.7MB. Free memory was 185.3MB in the beginning and 183.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 294.45ms. Allocated memory is still 208.7MB. Free memory was 183.8MB in the beginning and 171.9MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 14080.06ms. Allocated memory was 208.7MB in the beginning and 251.7MB in the end (delta: 43.0MB). Free memory was 171.6MB in the beginning and 175.2MB in the end (delta: -3.7MB). Peak memory consumption was 40.4MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 666 IncrementalHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 108 mSDtfsCounter, 666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 223 SyntacticMatches, 15 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 13 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 76 PreInvPairs, 123 NumberOfFragments, 199 HoareAnnotationTreeSize, 76 FomulaSimplifications, 532 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 725 FormulaSimplificationTreeSizeReductionInter, 0.2s 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: 29]: Loop Invariant Derived loop invariant: ((((n * 2 <= i + 1 && n < k + 1) && (i <= n * 2 || k <= n)) && i + 1 <= n * 2) || (n == 0 && i == 0)) || (((i <= n * 2 && n < k + 1) && n * 2 <= i) && (i <= n * 2 || k <= n)) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:46:49,569 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...