/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-fb4f59a-m [2022-04-28 09:47:21,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:47:21,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:47:21,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:47:21,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:47:21,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:47:21,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:47:21,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:47:21,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:47:21,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:47:21,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:47:21,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:47:21,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:47:21,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:47:21,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:47:21,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:47:21,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:47:21,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:47:21,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:47:21,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:47:21,309 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:47:21,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:47:21,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:47:21,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:47:21,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:47:21,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:47:21,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:47:21,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:47:21,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:47:21,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:47:21,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:47:21,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:47:21,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:47:21,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:47:21,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:47:21,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:47:21,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:47:21,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:47:21,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:47:21,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:47:21,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:47:21,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:47:21,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:47:21,332 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:47:21,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:47:21,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:47:21,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:47:21,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:47:21,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:47:21,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:47:21,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:47:21,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:47:21,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:47:21,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:47:21,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:47:21,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:47:21,335 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:47:21,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:47:21,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:47:21,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:47:21,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:47:21,336 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:47:21,336 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:47:21,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:47:21,336 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:47:21,336 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:47:21,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:47:21,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:47:21,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:47:21,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:47:21,576 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:47:21,577 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-28 09:47:21,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc709e556/9842da55e4fc4b2b89c4b4e1bce38886/FLAG22c8b87e1 [2022-04-28 09:47:21,989 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:47:21,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2022-04-28 09:47:21,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc709e556/9842da55e4fc4b2b89c4b4e1bce38886/FLAG22c8b87e1 [2022-04-28 09:47:22,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc709e556/9842da55e4fc4b2b89c4b4e1bce38886 [2022-04-28 09:47:22,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:47:22,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:47:22,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:47:22,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:47:22,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:47:22,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53453db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22, skipping insertion in model container [2022-04-28 09:47:22,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:47:22,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:47:22,225 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-28 09:47:22,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:47:22,252 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:47:22,263 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-28 09:47:22,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:47:22,276 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:47:22,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22 WrapperNode [2022-04-28 09:47:22,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:47:22,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:47:22,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:47:22,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:47:22,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:47:22,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:47:22,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:47:22,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:47:22,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (1/1) ... [2022-04-28 09:47:22,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:47:22,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:22,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:47:22,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:47:22,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:47:22,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:47:22,369 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:47:22,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:47:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:47:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:47:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:47:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:47:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:47:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:47:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:47:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:47:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:47:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:47:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:47:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:47:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:47:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:47:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:47:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:47:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:47:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:47:22,432 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:47:22,434 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:47:22,581 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:47:22,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:47:22,585 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:47:22,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:47:22 BoogieIcfgContainer [2022-04-28 09:47:22,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:47:22,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:47:22,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:47:22,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:47:22,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:47:22" (1/3) ... [2022-04-28 09:47:22,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f635fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:47:22, skipping insertion in model container [2022-04-28 09:47:22,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:47:22" (2/3) ... [2022-04-28 09:47:22,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f635fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:47:22, skipping insertion in model container [2022-04-28 09:47:22,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:47:22" (3/3) ... [2022-04-28 09:47:22,623 INFO L111 eAbstractionObserver]: Analyzing ICFG half.i [2022-04-28 09:47:22,634 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:47:22,634 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:47:22,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:47:22,685 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73536eb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3032a219 [2022-04-28 09:47:22,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:47:22,692 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-28 09:47:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:47:22,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:22,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:22,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 1 times [2022-04-28 09:47:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [588261873] [2022-04-28 09:47:22,720 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:47:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 2 times [2022-04-28 09:47:22,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:22,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617080855] [2022-04-28 09:47:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:22,904 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-28 09:47:22,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:47:22,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-28 09:47:22,906 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-28 09:47:22,906 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-28 09:47:22,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:47:22,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-28 09:47:22,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret4 := main(); {25#true} is VALID [2022-04-28 09:47:22,908 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-28 09:47:22,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {25#true} is VALID [2022-04-28 09:47:22,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 09:47:22,909 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-28 09:47:22,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 09:47:22,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 09:47:22,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 09:47:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:22,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:22,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617080855] [2022-04-28 09:47:22,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617080855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:22,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:22,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:47:22,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:22,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [588261873] [2022-04-28 09:47:22,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [588261873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:22,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:22,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:47:22,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649917093] [2022-04-28 09:47:22,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:22,922 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-28 09:47:22,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:22,925 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-28 09:47:22,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:22,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:47:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:22,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:47:22,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:47:22,963 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-28 09:47:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:23,040 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 09:47:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:47:23,041 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-28 09:47:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:23,042 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-28 09:47:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 09:47:23,050 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-28 09:47:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 09:47:23,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-28 09:47:23,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:23,129 INFO L225 Difference]: With dead ends: 34 [2022-04-28 09:47:23,130 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:47:23,131 INFO L412 NwaCegarLoop]: 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-28 09:47:23,133 INFO L413 NwaCegarLoop]: 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-28 09:47:23,134 INFO L414 NwaCegarLoop]: 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-28 09:47:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:47:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:47:23,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:23,162 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-28 09:47:23,163 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-28 09:47:23,163 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-28 09:47:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:23,167 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 09:47:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:47:23,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:23,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:23,168 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-28 09:47:23,168 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-28 09:47:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:23,171 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 09:47:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:47:23,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:23,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:23,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:23,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:23,172 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-28 09:47:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 09:47:23,174 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 09:47:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:23,174 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 09:47:23,175 INFO L496 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-28 09:47:23,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 09:47:23,199 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-28 09:47:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:47:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:47:23,204 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:23,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:23,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:47:23,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:23,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 1 times [2022-04-28 09:47:23,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:23,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821276627] [2022-04-28 09:47:23,208 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:47:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 2 times [2022-04-28 09:47:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:23,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874237117] [2022-04-28 09:47:23,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:23,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:23,379 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-28 09:47:23,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 09:47:23,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-28 09:47:23,380 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-28 09:47:23,381 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-28 09:47:23,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 09:47:23,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-28 09:47:23,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2022-04-28 09:47:23,382 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-28 09:47:23,383 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-28 09:47:23,384 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-28 09:47:23,384 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-28 09:47:23,385 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-28 09:47:23,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-28 09:47:23,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 09:47:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:23,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874237117] [2022-04-28 09:47:23,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874237117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:23,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:23,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:47:23,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821276627] [2022-04-28 09:47:23,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821276627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:23,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:23,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:47:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291583342] [2022-04-28 09:47:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:23,388 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-28 09:47:23,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:23,388 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-28 09:47:23,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:23,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:47:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:23,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:47:23,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:47:23,398 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-28 09:47:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:23,602 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 09:47:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:47:23,602 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-28 09:47:23,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:23,602 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-28 09:47:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 09:47:23,603 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-28 09:47:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 09:47:23,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-28 09:47:23,636 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-28 09:47:23,638 INFO L225 Difference]: With dead ends: 27 [2022-04-28 09:47:23,638 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 09:47:23,639 INFO L412 NwaCegarLoop]: 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-28 09:47:23,641 INFO L413 NwaCegarLoop]: 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-28 09:47:23,647 INFO L414 NwaCegarLoop]: 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-28 09:47:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 09:47:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-28 09:47:23,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:23,657 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-28 09:47:23,658 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-28 09:47:23,659 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-28 09:47:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:23,661 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 09:47:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 09:47:23,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:23,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:23,661 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-28 09:47:23,662 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-28 09:47:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:23,663 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 09:47:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 09:47:23,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:23,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:23,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:23,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:23,664 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-28 09:47:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 09:47:23,665 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-28 09:47:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:23,665 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 09:47:23,665 INFO L496 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-28 09:47:23,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 09:47:23,683 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-28 09:47:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 09:47:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:47:23,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:23,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:23,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:47:23,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -505067407, now seen corresponding path program 1 times [2022-04-28 09:47:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:23,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1750125560] [2022-04-28 09:47:23,705 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:23,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:23,706 INFO L85 PathProgramCache]: Analyzing trace with hash -505067407, now seen corresponding path program 2 times [2022-04-28 09:47:23,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:23,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962904781] [2022-04-28 09:47:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:23,872 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-28 09:47:23,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-28 09:47:23,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-28 09:47:23,873 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-28 09:47:23,873 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-28 09:47:23,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-28 09:47:23,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-28 09:47:23,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-28 09:47:23,874 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-28 09:47:23,874 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-28 09:47:23,875 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-28 09:47:23,875 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-28 09:47:23,876 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-28 09:47:23,877 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-28 09:47:23,877 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-28 09:47:23,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2022-04-28 09:47:23,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2022-04-28 09:47:23,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-28 09:47:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:23,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:23,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962904781] [2022-04-28 09:47:23,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962904781] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:47:23,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293501281] [2022-04-28 09:47:23,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:47:23,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:23,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:23,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:47:23,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:47:23,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:47:23,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:23,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:47:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:23,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:24,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-28 09:47:24,046 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-28 09:47:24,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-28 09:47:24,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-28 09:47:24,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-28 09:47:24,046 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-28 09:47:24,047 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-28 09:47:24,047 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-28 09:47:24,048 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-28 09:47:24,049 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-28 09:47:24,049 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-28 09:47:24,049 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-28 09:47:24,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2022-04-28 09:47:24,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2022-04-28 09:47:24,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-28 09:47:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:24,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:24,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-28 09:47:24,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2022-04-28 09:47:24,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2022-04-28 09:47:24,178 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-28 09:47:24,178 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-28 09:47:24,178 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-28 09:47:24,179 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-28 09:47:24,180 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-28 09:47:24,181 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-28 09:47:24,181 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-28 09:47:24,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-28 09:47:24,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-28 09:47:24,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-28 09:47:24,184 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-28 09:47:24,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-28 09:47:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:47:24,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293501281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:24,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:47:24,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2022-04-28 09:47:24,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:24,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1750125560] [2022-04-28 09:47:24,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1750125560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:24,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:24,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:47:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293875208] [2022-04-28 09:47:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:24,187 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-28 09:47:24,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:24,187 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-28 09:47:24,197 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-28 09:47:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:47:24,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:47:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:47:24,199 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-28 09:47:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:24,348 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-28 09:47:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:47:24,349 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-28 09:47:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:24,349 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-28 09:47:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 09:47:24,350 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-28 09:47:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 09:47:24,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-28 09:47:24,379 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-28 09:47:24,379 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:47:24,379 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 09:47:24,380 INFO L412 NwaCegarLoop]: 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-28 09:47:24,380 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:47:24,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 34 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:47:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 09:47:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-28 09:47:24,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:24,389 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-28 09:47:24,389 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-28 09:47:24,389 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-28 09:47:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:24,390 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 09:47:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 09:47:24,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:24,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:24,391 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-28 09:47:24,391 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-28 09:47:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:24,391 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 09:47:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 09:47:24,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:24,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:24,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:24,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:24,392 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-28 09:47:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 09:47:24,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-28 09:47:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:24,393 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 09:47:24,393 INFO L496 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-28 09:47:24,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 09:47:24,409 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-28 09:47:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:47:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:47:24,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:24,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:24,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:47:24,630 WARN L477 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-28 09:47:24,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:24,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1214691282, now seen corresponding path program 1 times [2022-04-28 09:47:24,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:24,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505926313] [2022-04-28 09:47:24,638 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:24,639 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1214691282, now seen corresponding path program 2 times [2022-04-28 09:47:24,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:24,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276870468] [2022-04-28 09:47:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:24,856 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-28 09:47:24,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {573#true} assume true; {573#true} is VALID [2022-04-28 09:47:24,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {573#true} {573#true} #60#return; {573#true} is VALID [2022-04-28 09:47:24,857 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-28 09:47:24,857 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-28 09:47:24,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2022-04-28 09:47:24,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #60#return; {573#true} is VALID [2022-04-28 09:47:24,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret4 := main(); {573#true} is VALID [2022-04-28 09:47:24,859 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-28 09:47:24,860 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-28 09:47:24,860 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-28 09:47:24,861 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-28 09:47:24,862 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-28 09:47:24,862 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-28 09:47:24,863 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-28 09:47:24,863 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-28 09:47:24,864 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-28 09:47:24,865 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-28 09:47:24,865 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-28 09:47:24,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {586#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {574#false} is VALID [2022-04-28 09:47:24,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#false} assume !false; {574#false} is VALID [2022-04-28 09:47:24,866 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-28 09:47:24,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:24,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276870468] [2022-04-28 09:47:24,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276870468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:47:24,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181339506] [2022-04-28 09:47:24,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:47:24,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:24,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:24,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:47:24,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:47:24,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:47:24,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:24,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:47:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:24,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:25,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2022-04-28 09:47:25,201 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-28 09:47:25,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2022-04-28 09:47:25,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #60#return; {573#true} is VALID [2022-04-28 09:47:25,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret4 := main(); {573#true} is VALID [2022-04-28 09:47:25,202 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-28 09:47:25,203 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-28 09:47:25,203 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-28 09:47:25,203 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-28 09:47:25,204 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-28 09:47:25,204 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-28 09:47:25,205 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-28 09:47:25,205 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-28 09:47:25,206 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-28 09:47:25,206 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-28 09:47:25,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:25,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {574#false} is VALID [2022-04-28 09:47:25,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#false} assume !false; {574#false} is VALID [2022-04-28 09:47:25,207 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-28 09:47:25,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:25,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#false} assume !false; {574#false} is VALID [2022-04-28 09:47:25,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {574#false} is VALID [2022-04-28 09:47:25,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:25,606 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-28 09:47:25,607 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-28 09:47:25,609 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-28 09:47:25,609 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-28 09:47:25,610 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-28 09:47:25,611 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-28 09:47:25,613 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-28 09:47:25,620 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-28 09:47:25,621 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-28 09:47:25,622 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-28 09:47:25,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret4 := main(); {573#true} is VALID [2022-04-28 09:47:25,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #60#return; {573#true} is VALID [2022-04-28 09:47:25,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2022-04-28 09:47:25,622 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-28 09:47:25,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2022-04-28 09:47:25,622 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-28 09:47:25,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181339506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:25,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:47:25,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-04-28 09:47:25,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:25,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505926313] [2022-04-28 09:47:25,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505926313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:25,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:25,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:47:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016970103] [2022-04-28 09:47:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:25,623 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-28 09:47:25,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:25,624 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-28 09:47:25,638 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-28 09:47:25,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:47:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:25,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:47:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:47:25,639 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-28 09:47:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:26,067 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 09:47:26,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:47:26,067 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-28 09:47:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:26,068 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-28 09:47:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-28 09:47:26,069 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-28 09:47:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-28 09:47:26,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2022-04-28 09:47:26,101 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-28 09:47:26,102 INFO L225 Difference]: With dead ends: 28 [2022-04-28 09:47:26,102 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 09:47:26,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:47:26,103 INFO L413 NwaCegarLoop]: 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-28 09:47:26,103 INFO L414 NwaCegarLoop]: 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-28 09:47:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 09:47:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-28 09:47:26,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:26,121 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-28 09:47:26,121 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-28 09:47:26,122 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-28 09:47:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:26,123 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 09:47:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 09:47:26,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:26,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:26,123 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-28 09:47:26,123 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-28 09:47:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:26,124 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 09:47:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 09:47:26,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:26,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:26,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:26,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:26,125 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-28 09:47:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 09:47:26,125 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-04-28 09:47:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:26,126 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 09:47:26,126 INFO L496 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-28 09:47:26,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 09:47:26,147 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-28 09:47:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 09:47:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:47:26,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:26,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:26,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:47:26,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 09:47:26,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash -560316080, now seen corresponding path program 3 times [2022-04-28 09:47:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:26,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661039688] [2022-04-28 09:47:26,370 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:26,370 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash -560316080, now seen corresponding path program 4 times [2022-04-28 09:47:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:26,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616781293] [2022-04-28 09:47:26,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:26,445 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-28 09:47:26,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-28 09:47:26,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {868#true} {868#true} #60#return; {868#true} is VALID [2022-04-28 09:47:26,446 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-28 09:47:26,446 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-28 09:47:26,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-28 09:47:26,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #60#return; {868#true} is VALID [2022-04-28 09:47:26,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret4 := main(); {868#true} is VALID [2022-04-28 09:47:26,446 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-28 09:47:26,446 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-28 09:47:26,447 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-28 09:47:26,447 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-28 09:47:26,447 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-28 09:47:26,448 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-28 09:47:26,448 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-28 09:47:26,448 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-28 09:47:26,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#false} assume !(~i~0 < 2 * ~k~0); {869#false} is VALID [2022-04-28 09:47:26,449 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-28 09:47:26,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {869#false} ~cond := #in~cond; {869#false} is VALID [2022-04-28 09:47:26,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#false} assume 0 == ~cond; {869#false} is VALID [2022-04-28 09:47:26,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {869#false} assume !false; {869#false} is VALID [2022-04-28 09:47:26,449 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-28 09:47:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:26,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616781293] [2022-04-28 09:47:26,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616781293] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:47:26,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126530375] [2022-04-28 09:47:26,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:47:26,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:26,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:26,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:47:26,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:47:26,497 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:47:26,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:26,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:47:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:26,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:26,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {868#true} is VALID [2022-04-28 09:47:26,642 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-28 09:47:26,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-28 09:47:26,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #60#return; {868#true} is VALID [2022-04-28 09:47:26,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret4 := main(); {868#true} is VALID [2022-04-28 09:47:26,642 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-28 09:47:26,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {868#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {868#true} is VALID [2022-04-28 09:47:26,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {868#true} assume !!(~i~0 < 2 * ~k~0); {868#true} is VALID [2022-04-28 09:47:26,643 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-28 09:47:26,643 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-28 09:47:26,643 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-28 09:47:26,644 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-28 09:47:26,644 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-28 09:47:26,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#false} assume !(~i~0 < 2 * ~k~0); {869#false} is VALID [2022-04-28 09:47:26,644 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-28 09:47:26,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {869#false} ~cond := #in~cond; {869#false} is VALID [2022-04-28 09:47:26,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#false} assume 0 == ~cond; {869#false} is VALID [2022-04-28 09:47:26,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {869#false} assume !false; {869#false} is VALID [2022-04-28 09:47:26,644 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-28 09:47:26,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:47:26,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126530375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:26,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:47:26,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-04-28 09:47:26,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:26,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661039688] [2022-04-28 09:47:26,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661039688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:26,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:26,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:47:26,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965066235] [2022-04-28 09:47:26,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:26,646 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-28 09:47:26,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:26,646 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-28 09:47:26,656 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-28 09:47:26,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:47:26,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:47:26,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:47:26,657 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-28 09:47:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:26,722 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-28 09:47:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:47:26,722 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-28 09:47:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:26,722 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-28 09:47:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 09:47:26,723 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-28 09:47:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 09:47:26,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-28 09:47:26,743 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-28 09:47:26,743 INFO L225 Difference]: With dead ends: 38 [2022-04-28 09:47:26,743 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 09:47:26,744 INFO L412 NwaCegarLoop]: 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-28 09:47:26,744 INFO L413 NwaCegarLoop]: 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-28 09:47:26,744 INFO L414 NwaCegarLoop]: 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-28 09:47:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 09:47:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-28 09:47:26,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:26,768 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-28 09:47:26,768 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-28 09:47:26,768 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-28 09:47:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:26,769 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-28 09:47:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 09:47:26,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:26,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:26,769 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-28 09:47:26,770 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-28 09:47:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:26,770 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-28 09:47:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 09:47:26,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:26,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:26,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:26,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:26,787 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-28 09:47:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-28 09:47:26,788 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2022-04-28 09:47:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:26,788 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-28 09:47:26,788 INFO L496 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-28 09:47:26,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-28 09:47:26,813 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-28 09:47:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 09:47:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:47:26,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:26,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:26,833 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-28 09:47:27,030 WARN L477 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-28 09:47:27,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1894086065, now seen corresponding path program 3 times [2022-04-28 09:47:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:27,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241652134] [2022-04-28 09:47:27,037 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:27,038 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1894086065, now seen corresponding path program 4 times [2022-04-28 09:47:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:27,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660206301] [2022-04-28 09:47:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:27,154 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-28 09:47:27,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-28 09:47:27,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1110#true} {1110#true} #60#return; {1110#true} is VALID [2022-04-28 09:47:27,155 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-28 09:47:27,155 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-28 09:47:27,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-28 09:47:27,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #60#return; {1110#true} is VALID [2022-04-28 09:47:27,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret4 := main(); {1110#true} is VALID [2022-04-28 09:47:27,156 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-28 09:47:27,156 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-28 09:47:27,156 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-28 09:47:27,158 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-28 09:47:27,158 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-28 09:47:27,159 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-28 09:47:27,159 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-28 09:47:27,160 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-28 09:47:27,160 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-28 09:47:27,161 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-28 09:47:27,161 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-28 09:47:27,162 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-28 09:47:27,162 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-28 09:47:27,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-28 09:47:27,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-28 09:47:27,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-28 09:47:27,163 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-28 09:47:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:27,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660206301] [2022-04-28 09:47:27,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660206301] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:47:27,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433630299] [2022-04-28 09:47:27,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:47:27,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:27,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:27,164 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-28 09:47:27,165 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-28 09:47:27,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:47:27,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:27,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:47:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:27,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:27,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1110#true} is VALID [2022-04-28 09:47:27,626 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-28 09:47:27,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-28 09:47:27,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #60#return; {1110#true} is VALID [2022-04-28 09:47:27,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret4 := main(); {1110#true} is VALID [2022-04-28 09:47:27,626 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-28 09:47:27,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {1110#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1110#true} is VALID [2022-04-28 09:47:27,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} assume !!(~i~0 < 2 * ~k~0); {1110#true} is VALID [2022-04-28 09:47:27,626 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-28 09:47:27,626 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-28 09:47:27,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {1110#true} assume !!(~i~0 < 2 * ~k~0); {1110#true} is VALID [2022-04-28 09:47:27,630 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-28 09:47:27,631 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-28 09:47:27,631 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-28 09:47:27,632 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-28 09:47:27,632 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-28 09:47:27,633 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-28 09:47:27,633 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-28 09:47:27,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-28 09:47:27,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-28 09:47:27,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-28 09:47:27,633 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-28 09:47:27,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:27,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-28 09:47:27,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-28 09:47:27,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-28 09:47:27,806 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-28 09:47:27,806 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-28 09:47:27,807 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-28 09:47:27,807 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-28 09:47:27,808 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-28 09:47:27,808 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-28 09:47:27,808 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-28 09:47:27,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {1110#true} assume !!(~i~0 < 2 * ~k~0); {1110#true} is VALID [2022-04-28 09:47:27,809 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-28 09:47:27,809 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-28 09:47:27,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} assume !!(~i~0 < 2 * ~k~0); {1110#true} is VALID [2022-04-28 09:47:27,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {1110#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1110#true} is VALID [2022-04-28 09:47:27,809 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-28 09:47:27,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {1110#true} call #t~ret4 := main(); {1110#true} is VALID [2022-04-28 09:47:27,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1110#true} {1110#true} #60#return; {1110#true} is VALID [2022-04-28 09:47:27,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-28 09:47:27,809 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-28 09:47:27,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1110#true} is VALID [2022-04-28 09:47:27,815 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-28 09:47:27,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433630299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:27,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:47:27,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 16 [2022-04-28 09:47:27,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:27,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241652134] [2022-04-28 09:47:27,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241652134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:27,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:27,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:47:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317701303] [2022-04-28 09:47:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:27,816 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-28 09:47:27,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:27,816 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-28 09:47:27,826 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-28 09:47:27,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:47:27,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:27,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:47:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:47:27,829 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-28 09:47:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:28,060 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-28 09:47:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:47:28,060 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-28 09:47:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:28,060 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-28 09:47:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 09:47:28,061 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-28 09:47:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 09:47:28,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-28 09:47:28,081 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-28 09:47:28,082 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:47:28,082 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:47:28,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:47:28,083 INFO L413 NwaCegarLoop]: 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-28 09:47:28,083 INFO L414 NwaCegarLoop]: 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-28 09:47:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:47:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-28 09:47:28,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:28,122 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-28 09:47:28,122 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-28 09:47:28,122 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-28 09:47:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:28,125 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:47:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:47:28,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:28,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:28,126 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-28 09:47:28,126 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-28 09:47:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:28,127 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:47:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:47:28,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:28,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:28,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:28,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:28,127 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-28 09:47:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-28 09:47:28,128 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2022-04-28 09:47:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:28,128 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-28 09:47:28,128 INFO L496 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-28 09:47:28,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-28 09:47:28,153 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-28 09:47:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 09:47:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:47:28,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:28,154 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:28,173 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-28 09:47:28,367 WARN L477 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-28 09:47:28,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:28,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1325219532, now seen corresponding path program 5 times [2022-04-28 09:47:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:28,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57221639] [2022-04-28 09:47:28,374 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:28,374 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1325219532, now seen corresponding path program 6 times [2022-04-28 09:47:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:28,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305500170] [2022-04-28 09:47:28,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:28,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:28,562 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-28 09:47:28,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1456#true} assume true; {1456#true} is VALID [2022-04-28 09:47:28,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1456#true} {1456#true} #60#return; {1456#true} is VALID [2022-04-28 09:47:28,566 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-28 09:47:28,567 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-28 09:47:28,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2022-04-28 09:47:28,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #60#return; {1456#true} is VALID [2022-04-28 09:47:28,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret4 := main(); {1456#true} is VALID [2022-04-28 09:47:28,568 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-28 09:47:28,569 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-28 09:47:28,570 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-28 09:47:28,570 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-28 09:47:28,570 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-28 09:47:28,571 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-28 09:47:28,571 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-28 09:47:28,573 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-28 09:47:28,574 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-28 09:47:28,574 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-28 09:47:28,575 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-28 09:47:28,575 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-28 09:47:28,576 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-28 09:47:28,576 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-28 09:47:28,577 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-28 09:47:28,577 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-28 09:47:28,577 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-28 09:47:28,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {1472#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1457#false} is VALID [2022-04-28 09:47:28,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2022-04-28 09:47:28,578 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-28 09:47:28,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:28,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305500170] [2022-04-28 09:47:28,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305500170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:47:28,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293836796] [2022-04-28 09:47:28,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:47:28,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:28,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:28,591 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-28 09:47:28,634 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-28 09:47:28,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:47:28,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:28,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:47:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:28,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:29,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2022-04-28 09:47:29,177 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-28 09:47:29,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2022-04-28 09:47:29,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #60#return; {1456#true} is VALID [2022-04-28 09:47:29,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret4 := main(); {1456#true} is VALID [2022-04-28 09:47:29,178 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-28 09:47:29,178 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-28 09:47:29,179 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-28 09:47:29,179 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-28 09:47:29,179 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-28 09:47:29,180 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-28 09:47:29,180 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-28 09:47:29,180 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-28 09:47:29,181 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-28 09:47:29,181 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-28 09:47:29,182 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-28 09:47:29,182 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-28 09:47:29,182 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-28 09:47:29,183 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-28 09:47:29,184 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-28 09:47:29,184 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-28 09:47:29,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {1544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:29,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {1548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1457#false} is VALID [2022-04-28 09:47:29,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2022-04-28 09:47:29,185 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-28 09:47:29,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:29,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2022-04-28 09:47:29,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {1548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1457#false} is VALID [2022-04-28 09:47:29,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {1544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:29,716 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-28 09:47:29,716 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-28 09:47:29,717 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-28 09:47:29,717 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-28 09:47:29,718 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-28 09:47:29,718 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-28 09:47:29,719 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-28 09:47:29,719 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-28 09:47:29,720 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-28 09:47:29,721 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-28 09:47:29,721 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-28 09:47:29,723 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-28 09:47:29,724 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-28 09:47:29,724 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-28 09:47:29,725 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-28 09:47:29,725 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-28 09:47:29,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret4 := main(); {1456#true} is VALID [2022-04-28 09:47:29,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #60#return; {1456#true} is VALID [2022-04-28 09:47:29,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2022-04-28 09:47:29,725 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-28 09:47:29,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2022-04-28 09:47:29,725 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-28 09:47:29,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293836796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:29,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:47:29,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-28 09:47:29,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:29,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57221639] [2022-04-28 09:47:29,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57221639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:29,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:29,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 09:47:29,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162148788] [2022-04-28 09:47:29,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:29,727 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-28 09:47:29,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:29,727 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-28 09:47:29,756 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-28 09:47:29,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 09:47:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:29,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 09:47:29,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 09:47:29,757 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-28 09:47:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:30,334 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 09:47:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 09:47:30,334 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-28 09:47:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:30,334 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-28 09:47:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2022-04-28 09:47:30,335 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-28 09:47:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2022-04-28 09:47:30,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 35 transitions. [2022-04-28 09:47:30,366 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-28 09:47:30,367 INFO L225 Difference]: With dead ends: 37 [2022-04-28 09:47:30,367 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 09:47:30,368 INFO L412 NwaCegarLoop]: 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-28 09:47:30,368 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:47:30,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:47:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 09:47:30,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-28 09:47:30,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:30,410 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-28 09:47:30,411 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-28 09:47:30,411 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-28 09:47:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:30,412 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 09:47:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 09:47:30,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:30,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:30,413 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-28 09:47:30,413 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-28 09:47:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:30,414 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 09:47:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 09:47:30,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:30,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:30,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:30,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:30,415 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-28 09:47:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-28 09:47:30,422 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2022-04-28 09:47:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:30,422 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-28 09:47:30,423 INFO L496 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-28 09:47:30,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-28 09:47:30,461 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-28 09:47:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-28 09:47:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 09:47:30,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:30,462 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:30,480 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-28 09:47:30,662 WARN L477 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-28 09:47:30,662 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash 356674989, now seen corresponding path program 7 times [2022-04-28 09:47:30,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:30,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644303409] [2022-04-28 09:47:30,681 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:30,682 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash 356674989, now seen corresponding path program 8 times [2022-04-28 09:47:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:30,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374525865] [2022-04-28 09:47:30,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:30,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:30,866 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-28 09:47:30,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1861#true} assume true; {1861#true} is VALID [2022-04-28 09:47:30,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1861#true} {1861#true} #60#return; {1861#true} is VALID [2022-04-28 09:47:30,867 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-28 09:47:30,867 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-28 09:47:30,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1861#true} assume true; {1861#true} is VALID [2022-04-28 09:47:30,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1861#true} {1861#true} #60#return; {1861#true} is VALID [2022-04-28 09:47:30,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {1861#true} call #t~ret4 := main(); {1861#true} is VALID [2022-04-28 09:47:30,868 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-28 09:47:30,868 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-28 09:47:30,868 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-28 09:47:30,869 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-28 09:47:30,869 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-28 09:47:30,871 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-28 09:47:30,872 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-28 09:47:30,872 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-28 09:47:30,874 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-28 09:47:30,874 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-28 09:47:30,875 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-28 09:47:30,875 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-28 09:47:30,876 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-28 09:47:30,876 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-28 09:47:30,876 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-28 09:47:30,877 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-28 09:47:30,877 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-28 09:47:30,877 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-28 09:47:30,878 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-28 09:47:30,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#false} ~cond := #in~cond; {1862#false} is VALID [2022-04-28 09:47:30,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#false} assume 0 == ~cond; {1862#false} is VALID [2022-04-28 09:47:30,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {1862#false} assume !false; {1862#false} is VALID [2022-04-28 09:47:30,878 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-28 09:47:30,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:30,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374525865] [2022-04-28 09:47:30,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374525865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:47:30,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668041645] [2022-04-28 09:47:30,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:47:30,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:30,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:30,886 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-28 09:47:30,887 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-28 09:47:30,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:47:30,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:30,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:47:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:30,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:31,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {1861#true} call ULTIMATE.init(); {1861#true} is VALID [2022-04-28 09:47:31,211 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-28 09:47:31,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {1861#true} assume true; {1861#true} is VALID [2022-04-28 09:47:31,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1861#true} {1861#true} #60#return; {1861#true} is VALID [2022-04-28 09:47:31,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {1861#true} call #t~ret4 := main(); {1861#true} is VALID [2022-04-28 09:47:31,213 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-28 09:47:31,213 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-28 09:47:31,214 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-28 09:47:31,214 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-28 09:47:31,215 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-28 09:47:31,215 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-28 09:47:31,215 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-28 09:47:31,216 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-28 09:47:31,216 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-28 09:47:31,217 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-28 09:47:31,217 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-28 09:47:31,217 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-28 09:47:31,218 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-28 09:47:31,218 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-28 09:47:31,218 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-28 09:47:31,219 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-28 09:47:31,219 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-28 09:47:31,220 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-28 09:47:31,220 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-28 09:47:31,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#false} ~cond := #in~cond; {1862#false} is VALID [2022-04-28 09:47:31,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#false} assume 0 == ~cond; {1862#false} is VALID [2022-04-28 09:47:31,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {1862#false} assume !false; {1862#false} is VALID [2022-04-28 09:47:31,220 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-28 09:47:31,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:31,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {1862#false} assume !false; {1862#false} is VALID [2022-04-28 09:47:31,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#false} assume 0 == ~cond; {1862#false} is VALID [2022-04-28 09:47:31,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#false} ~cond := #in~cond; {1862#false} is VALID [2022-04-28 09:47:31,398 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-28 09:47:31,398 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-28 09:47:31,399 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-28 09:47:31,399 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-28 09:47:31,400 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-28 09:47:31,400 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-28 09:47:31,401 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-28 09:47:31,401 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-28 09:47:31,402 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-28 09:47:31,402 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-28 09:47:31,402 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-28 09:47:31,403 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-28 09:47:31,404 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-28 09:47:31,404 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-28 09:47:31,405 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-28 09:47:31,405 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-28 09:47:31,405 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-28 09:47:31,406 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-28 09:47:31,406 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-28 09:47:31,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {1861#true} call #t~ret4 := main(); {1861#true} is VALID [2022-04-28 09:47:31,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1861#true} {1861#true} #60#return; {1861#true} is VALID [2022-04-28 09:47:31,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {1861#true} assume true; {1861#true} is VALID [2022-04-28 09:47:31,406 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-28 09:47:31,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {1861#true} call ULTIMATE.init(); {1861#true} is VALID [2022-04-28 09:47:31,406 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-28 09:47:31,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668041645] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:31,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:47:31,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 6] total 24 [2022-04-28 09:47:31,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:31,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644303409] [2022-04-28 09:47:31,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644303409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:31,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:31,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:47:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4771294] [2022-04-28 09:47:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:31,407 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-28 09:47:31,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:31,407 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-28 09:47:31,425 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-28 09:47:31,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:47:31,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:47:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:47:31,426 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-28 09:47:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:31,713 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 09:47:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:47:31,714 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-28 09:47:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:31,714 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-28 09:47:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-28 09:47:31,715 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-28 09:47:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-28 09:47:31,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2022-04-28 09:47:31,734 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-28 09:47:31,735 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:47:31,735 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 09:47:31,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:47:31,736 INFO L413 NwaCegarLoop]: 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-28 09:47:31,736 INFO L414 NwaCegarLoop]: 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-28 09:47:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 09:47:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 09:47:31,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:31,780 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-28 09:47:31,781 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-28 09:47:31,781 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-28 09:47:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:31,781 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 09:47:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 09:47:31,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:31,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:31,782 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-28 09:47:31,782 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-28 09:47:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:31,783 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 09:47:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 09:47:31,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:31,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:31,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:31,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:31,783 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-28 09:47:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 09:47:31,784 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-04-28 09:47:31,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:31,784 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 09:47:31,784 INFO L496 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-28 09:47:31,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 09:47:31,814 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-28 09:47:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 09:47:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 09:47:31,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:47:31,814 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:47:31,840 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-28 09:47:32,015 WARN L477 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-28 09:47:32,015 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:47:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:47:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1932084970, now seen corresponding path program 9 times [2022-04-28 09:47:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:32,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [292024609] [2022-04-28 09:47:32,021 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:47:32,021 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:47:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1932084970, now seen corresponding path program 10 times [2022-04-28 09:47:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:47:32,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103830258] [2022-04-28 09:47:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:47:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:47:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:32,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:47:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:32,287 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-28 09:47:32,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 09:47:32,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2259#true} {2259#true} #60#return; {2259#true} is VALID [2022-04-28 09:47:32,287 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-28 09:47:32,287 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-28 09:47:32,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 09:47:32,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #60#return; {2259#true} is VALID [2022-04-28 09:47:32,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret4 := main(); {2259#true} is VALID [2022-04-28 09:47:32,291 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-28 09:47:32,291 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-28 09:47:32,291 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-28 09:47:32,292 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-28 09:47:32,292 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-28 09:47:32,293 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-28 09:47:32,293 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-28 09:47:32,294 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-28 09:47:32,294 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-28 09:47:32,295 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-28 09:47:32,295 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-28 09:47:32,295 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-28 09:47:32,296 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-28 09:47:32,296 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-28 09:47:32,297 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-28 09:47:32,297 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-28 09:47:32,298 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-28 09:47:32,298 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-28 09:47:32,299 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-28 09:47:32,299 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-28 09:47:32,299 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-28 09:47:32,300 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-28 09:47:32,300 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-28 09:47:32,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {2276#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2260#false} is VALID [2022-04-28 09:47:32,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-28 09:47:32,301 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-28 09:47:32,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:47:32,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103830258] [2022-04-28 09:47:32,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103830258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:47:32,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67961253] [2022-04-28 09:47:32,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:47:32,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:47:32,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:47:32,308 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-28 09:47:32,309 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-28 09:47:32,340 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:47:32,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:47:32,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 09:47:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:47:32,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:47:32,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2022-04-28 09:47:32,899 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-28 09:47:32,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 09:47:32,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #60#return; {2259#true} is VALID [2022-04-28 09:47:32,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret4 := main(); {2259#true} is VALID [2022-04-28 09:47:32,900 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-28 09:47:32,900 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-28 09:47:32,900 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-28 09:47:32,901 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-28 09:47:32,901 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-28 09:47:32,901 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-28 09:47:32,902 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-28 09:47:32,902 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-28 09:47:32,902 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-28 09:47:32,903 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-28 09:47:32,903 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-28 09:47:32,904 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-28 09:47:32,904 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-28 09:47:32,904 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-28 09:47:32,905 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-28 09:47:32,905 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-28 09:47:32,906 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-28 09:47:32,906 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-28 09:47:32,906 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-28 09:47:32,907 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-28 09:47:32,907 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-28 09:47:32,908 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-28 09:47:32,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:32,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {2373#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2260#false} is VALID [2022-04-28 09:47:32,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-28 09:47:32,909 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-28 09:47:32,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:47:33,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-28 09:47:33,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {2373#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2260#false} is VALID [2022-04-28 09:47:33,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:47:33,716 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-28 09:47:33,717 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-28 09:47:33,717 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-28 09:47:33,717 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-28 09:47:33,718 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-28 09:47:33,719 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-28 09:47:33,720 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-28 09:47:33,720 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-28 09:47:33,721 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-28 09:47:33,722 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-28 09:47:33,722 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-28 09:47:33,737 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-28 09:47:33,740 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-28 09:47:33,740 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-28 09:47:33,741 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-28 09:47:33,742 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-28 09:47:33,742 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-28 09:47:33,743 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-28 09:47:33,744 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-28 09:47:33,745 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-28 09:47:33,745 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-28 09:47:33,745 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-28 09:47:33,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret4 := main(); {2259#true} is VALID [2022-04-28 09:47:33,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #60#return; {2259#true} is VALID [2022-04-28 09:47:33,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 09:47:33,746 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-28 09:47:33,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2022-04-28 09:47:33,746 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-28 09:47:33,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67961253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:47:33,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:47:33,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 40 [2022-04-28 09:47:33,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:47:33,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [292024609] [2022-04-28 09:47:33,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [292024609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:47:33,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:47:33,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:47:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737788776] [2022-04-28 09:47:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:47:33,747 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-28 09:47:33,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:47:33,748 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-28 09:47:33,766 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-28 09:47:33,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:47:33,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:47:33,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:47:33,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 09:47:33,768 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-28 09:47:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:34,152 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 09:47:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:47:34,152 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-28 09:47:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:47:34,152 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-28 09:47:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2022-04-28 09:47:34,154 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-28 09:47:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2022-04-28 09:47:34,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 21 transitions. [2022-04-28 09:47:34,183 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-28 09:47:34,183 INFO L225 Difference]: With dead ends: 31 [2022-04-28 09:47:34,183 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:47:34,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=2084, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 09:47:34,184 INFO L413 NwaCegarLoop]: 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-28 09:47:34,184 INFO L414 NwaCegarLoop]: 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-28 09:47:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:47:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:47:34,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:47:34,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:47:34,185 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:47:34,185 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:47:34,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:34,185 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:47:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:47:34,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:34,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:34,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:47:34,186 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:47:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:47:34,186 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:47:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:47:34,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:34,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:47:34,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:47:34,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:47:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:47:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:47:34,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-28 09:47:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:47:34,186 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:47:34,186 INFO L496 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-28 09:47:34,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:47:34,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:47:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:47:34,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:47:34,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:47:34,214 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-28 09:47:34,404 WARN L477 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-28 09:47:34,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:47:34,688 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:47:34,688 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:47:34,688 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:47:34,688 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:47:34,688 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:47:34,688 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:47:34,688 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:47:34,688 INFO L895 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-28 09:47:34,688 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 36) the Hoare annotation is: true [2022-04-28 09:47:34,688 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (= main_~n~0 0) (= main_~i~0 0)) [2022-04-28 09:47:34,689 INFO L895 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-28 09:47:34,689 INFO L895 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-28 09:47:34,689 INFO L895 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-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 36) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 36) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L895 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-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 09:47:34,689 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:47:34,689 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:47:34,689 INFO L895 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-28 09:47:34,691 INFO L356 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2] [2022-04-28 09:47:34,692 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:47:34,694 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:47:34,694 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:47:34,699 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:47:34,700 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:47:34,700 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:47:34,700 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:47:34,701 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:47:34,712 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-28 09:47:34,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:47:34 BoogieIcfgContainer [2022-04-28 09:47:34,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:47:34,719 INFO L158 Benchmark]: Toolchain (without parser) took 12708.16ms. Allocated memory was 176.2MB in the beginning and 362.8MB in the end (delta: 186.6MB). Free memory was 119.3MB in the beginning and 230.7MB in the end (delta: -111.4MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. [2022-04-28 09:47:34,719 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:47:34,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.85ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 119.2MB in the beginning and 223.0MB in the end (delta: -103.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-28 09:47:34,720 INFO L158 Benchmark]: Boogie Preprocessor took 33.86ms. Allocated memory is still 251.7MB. Free memory was 223.0MB in the beginning and 221.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:47:34,720 INFO L158 Benchmark]: RCFGBuilder took 274.13ms. Allocated memory is still 251.7MB. Free memory was 221.4MB in the beginning and 209.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 09:47:34,720 INFO L158 Benchmark]: TraceAbstraction took 12130.92ms. Allocated memory was 251.7MB in the beginning and 362.8MB in the end (delta: 111.1MB). Free memory was 208.8MB in the beginning and 230.7MB in the end (delta: -21.9MB). Peak memory consumption was 89.2MB. Max. memory is 8.0GB. [2022-04-28 09:47:34,721 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.13ms. Allocated memory is still 176.2MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.85ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 119.2MB in the beginning and 223.0MB in the end (delta: -103.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.86ms. Allocated memory is still 251.7MB. Free memory was 223.0MB in the beginning and 221.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 274.13ms. Allocated memory is still 251.7MB. Free memory was 221.4MB in the beginning and 209.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12130.92ms. Allocated memory was 251.7MB in the beginning and 362.8MB in the end (delta: 111.1MB). Free memory was 208.8MB in the beginning and 230.7MB in the end (delta: -21.9MB). Peak memory consumption was 89.2MB. 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: 12.0s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 0.6s 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.6s 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-28 09:47:34,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...