/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/nla-digbench-scaling/mannadiv_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 13:55:23,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 13:55:23,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 13:55:23,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 13:55:23,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 13:55:23,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 13:55:23,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 13:55:23,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 13:55:23,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 13:55:23,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 13:55:23,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 13:55:23,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 13:55:23,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 13:55:23,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 13:55:23,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 13:55:23,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 13:55:23,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 13:55:23,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 13:55:23,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 13:55:23,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 13:55:23,701 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 13:55:23,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 13:55:23,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 13:55:23,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 13:55:23,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 13:55:23,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 13:55:23,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 13:55:23,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 13:55:23,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 13:55:23,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 13:55:23,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 13:55:23,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 13:55:23,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 13:55:23,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 13:55:23,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 13:55:23,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 13:55:23,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 13:55:23,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 13:55:23,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 13:55:23,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 13:55:23,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 13:55:23,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 13:55:23,715 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 13:55:23,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 13:55:23,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 13:55:23,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 13:55:23,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 13:55:23,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 13:55:23,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 13:55:23,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 13:55:23,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:55:23,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 13:55:23,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 13:55:23,724 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 13:55:23,724 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 13:55:23,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 13:55:23,724 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 13:55:23,724 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 13:55:23,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 13:55:23,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 13:55:23,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 13:55:23,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 13:55:23,921 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 13:55:23,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-04-28 13:55:23,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e5a057b/1ec7100e65454338af35ed17f694280a/FLAGbd3acda6e [2022-04-28 13:55:24,305 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 13:55:24,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-04-28 13:55:24,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e5a057b/1ec7100e65454338af35ed17f694280a/FLAGbd3acda6e [2022-04-28 13:55:24,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e5a057b/1ec7100e65454338af35ed17f694280a [2022-04-28 13:55:24,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 13:55:24,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 13:55:24,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 13:55:24,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 13:55:24,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 13:55:24,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f700124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24, skipping insertion in model container [2022-04-28 13:55:24,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 13:55:24,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 13:55:24,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c[573,586] [2022-04-28 13:55:24,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:55:24,525 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 13:55:24,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c[573,586] [2022-04-28 13:55:24,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:55:24,553 INFO L208 MainTranslator]: Completed translation [2022-04-28 13:55:24,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24 WrapperNode [2022-04-28 13:55:24,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 13:55:24,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 13:55:24,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 13:55:24,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 13:55:24,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 13:55:24,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 13:55:24,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 13:55:24,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 13:55:24,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (1/1) ... [2022-04-28 13:55:24,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:55:24,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:24,620 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 13:55:24,638 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 13:55:24,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 13:55:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 13:55:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 13:55:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 13:55:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 13:55:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 13:55:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 13:55:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 13:55:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 13:55:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 13:55:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 13:55:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 13:55:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 13:55:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 13:55:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 13:55:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 13:55:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 13:55:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 13:55:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 13:55:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 13:55:24,700 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 13:55:24,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 13:55:24,811 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 13:55:24,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 13:55:24,816 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 13:55:24,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:55:24 BoogieIcfgContainer [2022-04-28 13:55:24,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 13:55:24,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 13:55:24,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 13:55:24,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 13:55:24,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:55:24" (1/3) ... [2022-04-28 13:55:24,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19be5b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:55:24, skipping insertion in model container [2022-04-28 13:55:24,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:55:24" (2/3) ... [2022-04-28 13:55:24,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19be5b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:55:24, skipping insertion in model container [2022-04-28 13:55:24,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:55:24" (3/3) ... [2022-04-28 13:55:24,822 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound10.c [2022-04-28 13:55:24,831 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 13:55:24,831 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 13:55:24,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 13:55:24,862 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@3bb385c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@145b52de [2022-04-28 13:55:24,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 13:55:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:55:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 13:55:24,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:24,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:24,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-28 13:55:24,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:24,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172386166] [2022-04-28 13:55:24,889 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-28 13:55:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:24,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921170989] [2022-04-28 13:55:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:55:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:25,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-28 13:55:25,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 13:55:25,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 13:55:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 13:55:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:25,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:55:25,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:55:25,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:55:25,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-28 13:55:25,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 13:55:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:25,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:55:25,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:55:25,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:55:25,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-28 13:55:25,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:55:25,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-28 13:55:25,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 13:55:25,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 13:55:25,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-28 13:55:25,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-28 13:55:25,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID [2022-04-28 13:55:25,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:55:25,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:55:25,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:55:25,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-28 13:55:25,058 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID [2022-04-28 13:55:25,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:55:25,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:55:25,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:55:25,058 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-28 13:55:25,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID [2022-04-28 13:55:25,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-28 13:55:25,059 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID [2022-04-28 13:55:25,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 13:55:25,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 13:55:25,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 13:55:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:25,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921170989] [2022-04-28 13:55:25,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921170989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:25,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:25,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:55:25,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:25,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172386166] [2022-04-28 13:55:25,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172386166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:25,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:25,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:55:25,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647903458] [2022-04-28 13:55:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:25,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:55:25,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:25,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:25,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 13:55:25,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 13:55:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:55:25,104 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:25,203 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-28 13:55:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 13:55:25,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:55:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 13:55:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 13:55:25,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-28 13:55:25,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:25,316 INFO L225 Difference]: With dead ends: 54 [2022-04-28 13:55:25,316 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 13:55:25,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 13:55:25,320 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:25,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 13:55:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 13:55:25,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:25,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:25,345 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:25,345 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:25,348 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 13:55:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 13:55:25,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:25,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:25,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 13:55:25,349 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 13:55:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:25,362 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 13:55:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 13:55:25,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:25,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:25,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:25,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 13:55:25,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-28 13:55:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:25,369 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 13:55:25,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-28 13:55:25,398 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 13:55:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 13:55:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 13:55:25,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:25,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:25,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 13:55:25,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-28 13:55:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:25,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072631470] [2022-04-28 13:55:25,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-28 13:55:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:25,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500324420] [2022-04-28 13:55:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:25,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:25,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:25,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778241933] [2022-04-28 13:55:25,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:55:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:25,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:25,438 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 13:55:25,439 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 13:55:25,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:55:25,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:25,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 13:55:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:25,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:25,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID [2022-04-28 13:55:25,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(<= ~counter~0 0)} {259#true} #67#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(<= ~counter~0 0)} call #t~ret7 := main(); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,653 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #59#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,653 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #61#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:25,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {316#(<= |main_#t~post6| 0)} is VALID [2022-04-28 13:55:25,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {316#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {260#false} is VALID [2022-04-28 13:55:25,660 INFO L272 TraceCheckUtils]: 19: Hoare triple {260#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {260#false} is VALID [2022-04-28 13:55:25,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {260#false} ~cond := #in~cond; {260#false} is VALID [2022-04-28 13:55:25,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {260#false} assume 0 == ~cond; {260#false} is VALID [2022-04-28 13:55:25,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {260#false} assume !false; {260#false} is VALID [2022-04-28 13:55:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:25,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:55:25,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:25,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500324420] [2022-04-28 13:55:25,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:25,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778241933] [2022-04-28 13:55:25,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778241933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:25,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:25,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:55:25,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:25,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072631470] [2022-04-28 13:55:25,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072631470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:25,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:25,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:55:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891464781] [2022-04-28 13:55:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:25,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 13:55:25,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:25,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,676 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 13:55:25,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 13:55:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:25,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 13:55:25,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:55:25,678 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:25,730 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 13:55:25,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 13:55:25,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 13:55:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 13:55:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 13:55:25,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 13:55:25,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:25,771 INFO L225 Difference]: With dead ends: 34 [2022-04-28 13:55:25,771 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 13:55:25,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:55:25,772 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:25,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 13:55:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 13:55:25,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:25,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:25,783 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:25,783 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:25,785 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 13:55:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:55:25,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:25,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:25,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 13:55:25,785 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 13:55:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:25,787 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 13:55:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:55:25,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:25,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:25,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:25,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 13:55:25,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-28 13:55:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:25,789 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 13:55:25,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:55:25,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 13:55:25,813 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 13:55:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:55:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 13:55:25,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:25,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:25,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 13:55:26,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:26,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:26,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-28 13:55:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:26,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [16096054] [2022-04-28 13:55:26,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-28 13:55:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:26,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313786915] [2022-04-28 13:55:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:26,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:26,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598050548] [2022-04-28 13:55:26,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:55:26,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:26,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:26,045 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 13:55:26,046 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 13:55:26,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:55:26,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:26,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:55:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:26,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:29,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 13:55:29,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {507#true} is VALID [2022-04-28 13:55:29,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:55:29,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #67#return; {507#true} is VALID [2022-04-28 13:55:29,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret7 := main(); {507#true} is VALID [2022-04-28 13:55:29,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {507#true} is VALID [2022-04-28 13:55:29,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {507#true} is VALID [2022-04-28 13:55:29,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 13:55:29,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 13:55:29,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:55:29,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #59#return; {507#true} is VALID [2022-04-28 13:55:29,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {507#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {507#true} is VALID [2022-04-28 13:55:29,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 13:55:29,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 13:55:29,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:55:29,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-28 13:55:29,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:55:29,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:55:29,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 10);havoc #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:55:29,506 INFO L272 TraceCheckUtils]: 19: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:55:29,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:55:29,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 13:55:29,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 13:55:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:29,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:55:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313786915] [2022-04-28 13:55:29,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598050548] [2022-04-28 13:55:29,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598050548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:29,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:29,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:55:29,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:29,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [16096054] [2022-04-28 13:55:29,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [16096054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:29,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:29,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:55:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485390691] [2022-04-28 13:55:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 13:55:29,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:29,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:55:29,526 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 13:55:29,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:55:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:55:29,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:55:29,527 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:55:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:29,663 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 13:55:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:55:29,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 13:55:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:55:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 13:55:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:55:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 13:55:29,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-28 13:55:29,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:29,697 INFO L225 Difference]: With dead ends: 37 [2022-04-28 13:55:29,697 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 13:55:29,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:55:29,706 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:29,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 13:55:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-28 13:55:29,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:29,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:55:29,726 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:55:29,727 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:55:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:29,731 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 13:55:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 13:55:29,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:29,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:29,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 13:55:29,738 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 13:55:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:29,740 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 13:55:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 13:55:29,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:29,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:29,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:29,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:55:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 13:55:29,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-28 13:55:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:29,742 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 13:55:29,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:55:29,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 13:55:29,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 13:55:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 13:55:29,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:29,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:29,792 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 13:55:29,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 13:55:29,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-28 13:55:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:29,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476589657] [2022-04-28 13:55:29,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-28 13:55:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570683714] [2022-04-28 13:55:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:29,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:30,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:30,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222990104] [2022-04-28 13:55:30,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:55:30,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:30,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:30,008 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 13:55:30,009 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 13:55:30,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:55:30,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:30,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 13:55:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:30,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:30,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 13:55:30,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID [2022-04-28 13:55:30,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:55:30,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-28 13:55:30,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-28 13:55:30,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID [2022-04-28 13:55:30,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:55:30,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:55:30,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:55:30,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:55:30,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-28 13:55:30,230 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:55:30,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:55:30,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:55:30,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:55:30,231 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 13:55:30,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-28 13:55:30,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-28 13:55:30,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 10);havoc #t~post6; {790#true} is VALID [2022-04-28 13:55:30,231 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:55:30,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:55:30,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:55:30,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:55:30,235 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:55:30,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:55:30,236 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:55:30,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:55:30,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 13:55:30,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 13:55:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:30,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:35,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 13:55:35,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 13:55:35,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:55:35,044 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:55:35,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:55:35,046 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-28 13:55:35,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:55:35,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:55:35,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:55:35,048 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:55:35,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 10);havoc #t~post6; {790#true} is VALID [2022-04-28 13:55:35,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-28 13:55:35,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-28 13:55:35,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 13:55:35,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:55:35,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:55:35,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:55:35,049 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:55:35,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-28 13:55:35,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:55:35,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:55:35,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:55:35,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:55:35,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID [2022-04-28 13:55:35,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-28 13:55:35,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-28 13:55:35,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:55:35,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID [2022-04-28 13:55:35,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 13:55:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:35,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:35,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570683714] [2022-04-28 13:55:35,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:35,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222990104] [2022-04-28 13:55:35,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222990104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:35,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:35,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 13:55:35,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476589657] [2022-04-28 13:55:35,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476589657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:35,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:35,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:55:35,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313032950] [2022-04-28 13:55:35,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 13:55:35,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:35,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:55:35,081 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 13:55:35,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:55:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:35,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:55:35,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:55:35,082 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:55:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:35,263 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 13:55:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:55:35,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 13:55:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:55:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 13:55:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:55:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 13:55:35,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 13:55:35,288 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 13:55:35,289 INFO L225 Difference]: With dead ends: 39 [2022-04-28 13:55:35,289 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 13:55:35,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 13:55:35,290 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:35,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 13:55:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-28 13:55:35,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:35,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:35,303 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:35,304 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:35,305 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 13:55:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 13:55:35,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:35,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:35,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 13:55:35,305 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 13:55:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:35,307 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 13:55:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 13:55:35,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:35,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:35,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:35,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:55:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 13:55:35,308 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-28 13:55:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:35,308 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 13:55:35,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:55:35,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 13:55:35,344 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 13:55:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 13:55:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 13:55:35,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:35,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:35,363 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 13:55:35,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:35,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:35,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-28 13:55:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:35,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [137767177] [2022-04-28 13:55:35,547 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-28 13:55:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:35,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957109792] [2022-04-28 13:55:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:35,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:35,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483716265] [2022-04-28 13:55:35,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:55:35,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:35,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:35,559 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 13:55:35,560 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 13:55:35,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:55:35,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:35,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:55:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:35,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:35,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 13:55:35,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#(<= ~counter~0 0)} {1183#true} #67#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#(<= ~counter~0 0)} call #t~ret7 := main(); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #59#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,733 INFO L272 TraceCheckUtils]: 11: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,736 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #61#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:35,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {1191#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {1240#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,738 INFO L272 TraceCheckUtils]: 19: Hoare triple {1240#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {1240#(<= ~counter~0 1)} ~cond := #in~cond; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {1240#(<= ~counter~0 1)} assume !(0 == ~cond); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {1240#(<= ~counter~0 1)} assume true; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,739 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1240#(<= ~counter~0 1)} {1240#(<= ~counter~0 1)} #63#return; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {1240#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {1240#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:35,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {1240#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1268#(<= |main_#t~post6| 1)} is VALID [2022-04-28 13:55:35,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {1184#false} is VALID [2022-04-28 13:55:35,741 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-28 13:55:35,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-28 13:55:35,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-28 13:55:35,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 13:55:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:35,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:35,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 13:55:35,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-28 13:55:35,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-28 13:55:35,875 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-28 13:55:35,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1184#false} is VALID [2022-04-28 13:55:35,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {1300#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1296#(< |main_#t~post6| 10)} is VALID [2022-04-28 13:55:35,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1300#(< ~counter~0 10)} is VALID [2022-04-28 13:55:35,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(< ~counter~0 10)} assume !!(0 != ~y3~0); {1300#(< ~counter~0 10)} is VALID [2022-04-28 13:55:35,876 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1183#true} {1300#(< ~counter~0 10)} #63#return; {1300#(< ~counter~0 10)} is VALID [2022-04-28 13:55:35,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:55:35,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:55:35,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:55:35,877 INFO L272 TraceCheckUtils]: 19: Hoare triple {1300#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:55:35,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {1300#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1300#(< ~counter~0 10)} is VALID [2022-04-28 13:55:35,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {1328#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1300#(< ~counter~0 10)} is VALID [2022-04-28 13:55:35,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {1328#(< ~counter~0 9)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1328#(< ~counter~0 9)} is VALID [2022-04-28 13:55:35,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#true} {1328#(< ~counter~0 9)} #61#return; {1328#(< ~counter~0 9)} is VALID [2022-04-28 13:55:35,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:55:35,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:55:35,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:55:35,879 INFO L272 TraceCheckUtils]: 11: Hoare triple {1328#(< ~counter~0 9)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:55:35,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1328#(< ~counter~0 9)} #59#return; {1328#(< ~counter~0 9)} is VALID [2022-04-28 13:55:35,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:55:35,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:55:35,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:55:35,880 INFO L272 TraceCheckUtils]: 6: Hoare triple {1328#(< ~counter~0 9)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:55:35,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#(< ~counter~0 9)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1328#(< ~counter~0 9)} is VALID [2022-04-28 13:55:35,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {1328#(< ~counter~0 9)} call #t~ret7 := main(); {1328#(< ~counter~0 9)} is VALID [2022-04-28 13:55:35,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1328#(< ~counter~0 9)} {1183#true} #67#return; {1328#(< ~counter~0 9)} is VALID [2022-04-28 13:55:35,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {1328#(< ~counter~0 9)} assume true; {1328#(< ~counter~0 9)} is VALID [2022-04-28 13:55:35,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1328#(< ~counter~0 9)} is VALID [2022-04-28 13:55:35,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 13:55:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:35,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:35,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957109792] [2022-04-28 13:55:35,884 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:35,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483716265] [2022-04-28 13:55:35,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483716265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:35,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:35,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 13:55:35,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:35,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [137767177] [2022-04-28 13:55:35,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [137767177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:35,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:35,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:55:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923307843] [2022-04-28 13:55:35,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:35,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 13:55:35,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:35,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:55:35,917 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 13:55:35,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:55:35,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:55:35,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:55:35,918 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:55:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:36,002 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 13:55:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:55:36,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 13:55:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:55:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 13:55:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:55:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 13:55:36,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 13:55:36,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:36,033 INFO L225 Difference]: With dead ends: 43 [2022-04-28 13:55:36,033 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 13:55:36,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:55:36,034 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:36,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 13:55:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 13:55:36,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:36,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:55:36,053 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:55:36,054 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:55:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:36,055 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 13:55:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:55:36,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:36,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:36,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 13:55:36,055 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 13:55:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:36,056 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 13:55:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:55:36,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:36,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:36,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:36,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:55:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 13:55:36,058 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-28 13:55:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:36,058 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 13:55:36,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:55:36,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 13:55:36,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:55:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 13:55:36,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:36,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:36,119 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 13:55:36,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:36,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-28 13:55:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:36,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272218664] [2022-04-28 13:55:36,309 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-28 13:55:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:36,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162082121] [2022-04-28 13:55:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:36,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:36,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633883366] [2022-04-28 13:55:36,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:55:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:36,327 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 13:55:36,328 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 13:55:36,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:55:36,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:36,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:55:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:36,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:36,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-28 13:55:36,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#(<= ~counter~0 0)} {1622#true} #67#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#(<= ~counter~0 0)} call #t~ret7 := main(); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {1630#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #59#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,577 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #61#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:36,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {1679#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,579 INFO L272 TraceCheckUtils]: 19: Hoare triple {1679#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {1679#(<= ~counter~0 1)} ~cond := #in~cond; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {1679#(<= ~counter~0 1)} assume !(0 == ~cond); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {1679#(<= ~counter~0 1)} assume true; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,580 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1679#(<= ~counter~0 1)} {1679#(<= ~counter~0 1)} #63#return; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {1679#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {1679#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:36,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {1679#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {1707#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,582 INFO L272 TraceCheckUtils]: 28: Hoare triple {1707#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {1707#(<= ~counter~0 2)} ~cond := #in~cond; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {1707#(<= ~counter~0 2)} assume !(0 == ~cond); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {1707#(<= ~counter~0 2)} assume true; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,583 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1707#(<= ~counter~0 2)} {1707#(<= ~counter~0 2)} #63#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {1707#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {1707#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:36,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {1707#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1735#(<= |main_#t~post6| 2)} is VALID [2022-04-28 13:55:36,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {1735#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {1623#false} is VALID [2022-04-28 13:55:36,585 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-28 13:55:36,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-28 13:55:36,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-28 13:55:36,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-28 13:55:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:36,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:36,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-28 13:55:36,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-28 13:55:36,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-28 13:55:36,786 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-28 13:55:36,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {1763#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1623#false} is VALID [2022-04-28 13:55:36,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {1767#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1763#(< |main_#t~post6| 10)} is VALID [2022-04-28 13:55:36,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1767#(< ~counter~0 10)} is VALID [2022-04-28 13:55:36,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {1767#(< ~counter~0 10)} assume !!(0 != ~y3~0); {1767#(< ~counter~0 10)} is VALID [2022-04-28 13:55:36,789 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1622#true} {1767#(< ~counter~0 10)} #63#return; {1767#(< ~counter~0 10)} is VALID [2022-04-28 13:55:36,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:55:36,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:55:36,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:55:36,790 INFO L272 TraceCheckUtils]: 28: Hoare triple {1767#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:55:36,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {1767#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1767#(< ~counter~0 10)} is VALID [2022-04-28 13:55:36,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {1795#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1767#(< ~counter~0 10)} is VALID [2022-04-28 13:55:36,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {1795#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1795#(< ~counter~0 9)} is VALID [2022-04-28 13:55:36,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {1795#(< ~counter~0 9)} assume !!(0 != ~y3~0); {1795#(< ~counter~0 9)} is VALID [2022-04-28 13:55:36,794 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1622#true} {1795#(< ~counter~0 9)} #63#return; {1795#(< ~counter~0 9)} is VALID [2022-04-28 13:55:36,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:55:36,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:55:36,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:55:36,795 INFO L272 TraceCheckUtils]: 19: Hoare triple {1795#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:55:36,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {1795#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {1795#(< ~counter~0 9)} is VALID [2022-04-28 13:55:36,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1795#(< ~counter~0 9)} is VALID [2022-04-28 13:55:36,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {1823#(< ~counter~0 8)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1823#(< ~counter~0 8)} is VALID [2022-04-28 13:55:36,796 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1622#true} {1823#(< ~counter~0 8)} #61#return; {1823#(< ~counter~0 8)} is VALID [2022-04-28 13:55:36,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:55:36,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:55:36,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:55:36,796 INFO L272 TraceCheckUtils]: 11: Hoare triple {1823#(< ~counter~0 8)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:55:36,797 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1622#true} {1823#(< ~counter~0 8)} #59#return; {1823#(< ~counter~0 8)} is VALID [2022-04-28 13:55:36,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:55:36,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:55:36,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:55:36,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {1823#(< ~counter~0 8)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:55:36,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {1823#(< ~counter~0 8)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1823#(< ~counter~0 8)} is VALID [2022-04-28 13:55:36,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {1823#(< ~counter~0 8)} call #t~ret7 := main(); {1823#(< ~counter~0 8)} is VALID [2022-04-28 13:55:36,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1823#(< ~counter~0 8)} {1622#true} #67#return; {1823#(< ~counter~0 8)} is VALID [2022-04-28 13:55:36,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {1823#(< ~counter~0 8)} assume true; {1823#(< ~counter~0 8)} is VALID [2022-04-28 13:55:36,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1823#(< ~counter~0 8)} is VALID [2022-04-28 13:55:36,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-28 13:55:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 13:55:36,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:36,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162082121] [2022-04-28 13:55:36,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:36,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633883366] [2022-04-28 13:55:36,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633883366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:36,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:36,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 13:55:36,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:36,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272218664] [2022-04-28 13:55:36,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272218664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:36,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:36,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:55:36,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724235541] [2022-04-28 13:55:36,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:36,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 13:55:36,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:36,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:55:36,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:36,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:55:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:55:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:55:36,828 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:55:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:36,934 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 13:55:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:55:36,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 13:55:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:55:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 13:55:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:55:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 13:55:36,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-28 13:55:36,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:36,972 INFO L225 Difference]: With dead ends: 52 [2022-04-28 13:55:36,972 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 13:55:36,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:55:36,973 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:36,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:36,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 13:55:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 13:55:37,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:37,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:55:37,003 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:55:37,003 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:55:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:37,004 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 13:55:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:55:37,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:37,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:37,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 13:55:37,005 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 13:55:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:37,006 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 13:55:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:55:37,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:37,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:37,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:37,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:55:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 13:55:37,008 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-28 13:55:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:37,008 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 13:55:37,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:55:37,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 13:55:37,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:55:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 13:55:37,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:37,059 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:37,076 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 13:55:37,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:37,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:37,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-28 13:55:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:37,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [357748030] [2022-04-28 13:55:37,273 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-28 13:55:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:37,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768067113] [2022-04-28 13:55:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:37,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:37,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921174089] [2022-04-28 13:55:37,283 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:55:37,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:37,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:37,284 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 13:55:37,285 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 13:55:37,337 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 13:55:37,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:37,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:55:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:37,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:37,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2022-04-28 13:55:37,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2181#(<= ~counter~0 0)} {2173#true} #67#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {2181#(<= ~counter~0 0)} call #t~ret7 := main(); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {2181#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {2181#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {2181#(<= ~counter~0 0)} ~cond := #in~cond; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {2181#(<= ~counter~0 0)} assume !(0 == ~cond); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2181#(<= ~counter~0 0)} {2181#(<= ~counter~0 0)} #59#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,592 INFO L272 TraceCheckUtils]: 11: Hoare triple {2181#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {2181#(<= ~counter~0 0)} ~cond := #in~cond; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {2181#(<= ~counter~0 0)} assume !(0 == ~cond); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,593 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2181#(<= ~counter~0 0)} {2181#(<= ~counter~0 0)} #61#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {2181#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:37,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {2181#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {2230#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,595 INFO L272 TraceCheckUtils]: 19: Hoare triple {2230#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#(<= ~counter~0 1)} ~cond := #in~cond; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#(<= ~counter~0 1)} assume !(0 == ~cond); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(<= ~counter~0 1)} assume true; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,597 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(<= ~counter~0 1)} {2230#(<= ~counter~0 1)} #63#return; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:37,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {2258#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,599 INFO L272 TraceCheckUtils]: 28: Hoare triple {2258#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {2258#(<= ~counter~0 2)} ~cond := #in~cond; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {2258#(<= ~counter~0 2)} assume !(0 == ~cond); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {2258#(<= ~counter~0 2)} assume true; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,600 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2258#(<= ~counter~0 2)} {2258#(<= ~counter~0 2)} #63#return; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {2258#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {2258#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:37,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {2258#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {2286#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,602 INFO L272 TraceCheckUtils]: 37: Hoare triple {2286#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {2286#(<= ~counter~0 3)} ~cond := #in~cond; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {2286#(<= ~counter~0 3)} assume !(0 == ~cond); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {2286#(<= ~counter~0 3)} assume true; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,603 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2286#(<= ~counter~0 3)} {2286#(<= ~counter~0 3)} #63#return; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {2286#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:37,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {2286#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2314#(<= |main_#t~post6| 3)} is VALID [2022-04-28 13:55:37,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {2314#(<= |main_#t~post6| 3)} assume !(#t~post6 < 10);havoc #t~post6; {2174#false} is VALID [2022-04-28 13:55:37,604 INFO L272 TraceCheckUtils]: 46: Hoare triple {2174#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2174#false} is VALID [2022-04-28 13:55:37,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-28 13:55:37,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-28 13:55:37,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-28 13:55:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:37,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:37,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-28 13:55:37,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-28 13:55:37,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-28 13:55:37,828 INFO L272 TraceCheckUtils]: 46: Hoare triple {2174#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2174#false} is VALID [2022-04-28 13:55:37,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {2342#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {2174#false} is VALID [2022-04-28 13:55:37,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {2346#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2342#(< |main_#t~post6| 10)} is VALID [2022-04-28 13:55:37,829 INFO L290 TraceCheckUtils]: 43: Hoare triple {2346#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2346#(< ~counter~0 10)} is VALID [2022-04-28 13:55:37,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {2346#(< ~counter~0 10)} assume !!(0 != ~y3~0); {2346#(< ~counter~0 10)} is VALID [2022-04-28 13:55:37,830 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2173#true} {2346#(< ~counter~0 10)} #63#return; {2346#(< ~counter~0 10)} is VALID [2022-04-28 13:55:37,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:55:37,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:55:37,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:55:37,830 INFO L272 TraceCheckUtils]: 37: Hoare triple {2346#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:55:37,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {2346#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {2346#(< ~counter~0 10)} is VALID [2022-04-28 13:55:37,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {2374#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2346#(< ~counter~0 10)} is VALID [2022-04-28 13:55:37,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {2374#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2374#(< ~counter~0 9)} is VALID [2022-04-28 13:55:37,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {2374#(< ~counter~0 9)} assume !!(0 != ~y3~0); {2374#(< ~counter~0 9)} is VALID [2022-04-28 13:55:37,832 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2173#true} {2374#(< ~counter~0 9)} #63#return; {2374#(< ~counter~0 9)} is VALID [2022-04-28 13:55:37,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:55:37,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:55:37,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:55:37,832 INFO L272 TraceCheckUtils]: 28: Hoare triple {2374#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:55:37,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {2374#(< ~counter~0 9)} is VALID [2022-04-28 13:55:37,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {2402#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2374#(< ~counter~0 9)} is VALID [2022-04-28 13:55:37,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {2402#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2402#(< ~counter~0 8)} is VALID [2022-04-28 13:55:37,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {2402#(< ~counter~0 8)} assume !!(0 != ~y3~0); {2402#(< ~counter~0 8)} is VALID [2022-04-28 13:55:37,834 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2173#true} {2402#(< ~counter~0 8)} #63#return; {2402#(< ~counter~0 8)} is VALID [2022-04-28 13:55:37,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:55:37,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:55:37,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:55:37,834 INFO L272 TraceCheckUtils]: 19: Hoare triple {2402#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:55:37,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {2402#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {2402#(< ~counter~0 8)} is VALID [2022-04-28 13:55:37,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2402#(< ~counter~0 8)} is VALID [2022-04-28 13:55:37,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#(< ~counter~0 7)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2430#(< ~counter~0 7)} is VALID [2022-04-28 13:55:37,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2173#true} {2430#(< ~counter~0 7)} #61#return; {2430#(< ~counter~0 7)} is VALID [2022-04-28 13:55:37,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:55:37,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:55:37,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:55:37,836 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#(< ~counter~0 7)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:55:37,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2173#true} {2430#(< ~counter~0 7)} #59#return; {2430#(< ~counter~0 7)} is VALID [2022-04-28 13:55:37,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:55:37,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:55:37,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:55:37,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#(< ~counter~0 7)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:55:37,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#(< ~counter~0 7)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2430#(< ~counter~0 7)} is VALID [2022-04-28 13:55:37,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#(< ~counter~0 7)} call #t~ret7 := main(); {2430#(< ~counter~0 7)} is VALID [2022-04-28 13:55:37,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#(< ~counter~0 7)} {2173#true} #67#return; {2430#(< ~counter~0 7)} is VALID [2022-04-28 13:55:37,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#(< ~counter~0 7)} assume true; {2430#(< ~counter~0 7)} is VALID [2022-04-28 13:55:37,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2430#(< ~counter~0 7)} is VALID [2022-04-28 13:55:37,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2022-04-28 13:55:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 13:55:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:37,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768067113] [2022-04-28 13:55:37,841 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:37,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921174089] [2022-04-28 13:55:37,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921174089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:37,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:37,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 13:55:37,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:37,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [357748030] [2022-04-28 13:55:37,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [357748030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:37,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:37,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:55:37,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142739765] [2022-04-28 13:55:37,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:37,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 13:55:37,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:37,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:55:37,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:37,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:55:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:55:37,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:55:37,872 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:55:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:37,993 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 13:55:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:55:37,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 13:55:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:55:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 13:55:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:55:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 13:55:37,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-28 13:55:38,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:38,041 INFO L225 Difference]: With dead ends: 61 [2022-04-28 13:55:38,041 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 13:55:38,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:55:38,042 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:38,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 13:55:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 13:55:38,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:38,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:55:38,085 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:55:38,086 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:55:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:38,087 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 13:55:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:55:38,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:38,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:38,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 13:55:38,088 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 13:55:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:38,089 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 13:55:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:55:38,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:38,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:38,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:38,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:55:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-28 13:55:38,091 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-28 13:55:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:38,091 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-28 13:55:38,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:55:38,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-28 13:55:38,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:55:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 13:55:38,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:38,145 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:38,162 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 13:55:38,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:38,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-28 13:55:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:38,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [863648515] [2022-04-28 13:55:38,360 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-28 13:55:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:38,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935592835] [2022-04-28 13:55:38,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:38,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:38,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056049007] [2022-04-28 13:55:38,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:55:38,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:38,380 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 13:55:38,381 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 13:55:38,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:55:38,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:38,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:55:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:38,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:38,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2836#true} is VALID [2022-04-28 13:55:38,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2844#(<= ~counter~0 0)} {2836#true} #67#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {2844#(<= ~counter~0 0)} call #t~ret7 := main(); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {2844#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {2844#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {2844#(<= ~counter~0 0)} ~cond := #in~cond; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {2844#(<= ~counter~0 0)} assume !(0 == ~cond); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,701 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2844#(<= ~counter~0 0)} {2844#(<= ~counter~0 0)} #59#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,702 INFO L272 TraceCheckUtils]: 11: Hoare triple {2844#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {2844#(<= ~counter~0 0)} ~cond := #in~cond; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {2844#(<= ~counter~0 0)} assume !(0 == ~cond); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,703 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2844#(<= ~counter~0 0)} {2844#(<= ~counter~0 0)} #61#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {2844#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:38,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {2893#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,705 INFO L272 TraceCheckUtils]: 19: Hoare triple {2893#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {2893#(<= ~counter~0 1)} ~cond := #in~cond; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {2893#(<= ~counter~0 1)} assume !(0 == ~cond); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {2893#(<= ~counter~0 1)} assume true; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,706 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2893#(<= ~counter~0 1)} {2893#(<= ~counter~0 1)} #63#return; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {2893#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {2893#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:38,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {2893#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {2921#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {2921#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {2921#(<= ~counter~0 2)} ~cond := #in~cond; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {2921#(<= ~counter~0 2)} assume !(0 == ~cond); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#(<= ~counter~0 2)} assume true; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,709 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2921#(<= ~counter~0 2)} {2921#(<= ~counter~0 2)} #63#return; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {2921#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:38,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {2921#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {2949#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,711 INFO L272 TraceCheckUtils]: 37: Hoare triple {2949#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= ~counter~0 3)} ~cond := #in~cond; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {2949#(<= ~counter~0 3)} assume !(0 == ~cond); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {2949#(<= ~counter~0 3)} assume true; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,712 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2949#(<= ~counter~0 3)} {2949#(<= ~counter~0 3)} #63#return; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {2949#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {2949#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:38,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {2949#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {2977#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,714 INFO L272 TraceCheckUtils]: 46: Hoare triple {2977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {2977#(<= ~counter~0 4)} ~cond := #in~cond; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {2977#(<= ~counter~0 4)} assume !(0 == ~cond); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {2977#(<= ~counter~0 4)} assume true; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,715 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2977#(<= ~counter~0 4)} {2977#(<= ~counter~0 4)} #63#return; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {2977#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {2977#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:38,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {2977#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3005#(<= |main_#t~post6| 4)} is VALID [2022-04-28 13:55:38,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {3005#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {2837#false} is VALID [2022-04-28 13:55:38,717 INFO L272 TraceCheckUtils]: 55: Hoare triple {2837#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2837#false} is VALID [2022-04-28 13:55:38,717 INFO L290 TraceCheckUtils]: 56: Hoare triple {2837#false} ~cond := #in~cond; {2837#false} is VALID [2022-04-28 13:55:38,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {2837#false} assume 0 == ~cond; {2837#false} is VALID [2022-04-28 13:55:38,717 INFO L290 TraceCheckUtils]: 58: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-28 13:55:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:38,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:39,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-28 13:55:39,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {2837#false} assume 0 == ~cond; {2837#false} is VALID [2022-04-28 13:55:39,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {2837#false} ~cond := #in~cond; {2837#false} is VALID [2022-04-28 13:55:39,013 INFO L272 TraceCheckUtils]: 55: Hoare triple {2837#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2837#false} is VALID [2022-04-28 13:55:39,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {3033#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {2837#false} is VALID [2022-04-28 13:55:39,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {3037#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3033#(< |main_#t~post6| 10)} is VALID [2022-04-28 13:55:39,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {3037#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3037#(< ~counter~0 10)} is VALID [2022-04-28 13:55:39,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {3037#(< ~counter~0 10)} assume !!(0 != ~y3~0); {3037#(< ~counter~0 10)} is VALID [2022-04-28 13:55:39,015 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2836#true} {3037#(< ~counter~0 10)} #63#return; {3037#(< ~counter~0 10)} is VALID [2022-04-28 13:55:39,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:55:39,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:55:39,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:55:39,015 INFO L272 TraceCheckUtils]: 46: Hoare triple {3037#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:55:39,016 INFO L290 TraceCheckUtils]: 45: Hoare triple {3037#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {3037#(< ~counter~0 10)} is VALID [2022-04-28 13:55:39,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {3065#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3037#(< ~counter~0 10)} is VALID [2022-04-28 13:55:39,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {3065#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3065#(< ~counter~0 9)} is VALID [2022-04-28 13:55:39,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {3065#(< ~counter~0 9)} assume !!(0 != ~y3~0); {3065#(< ~counter~0 9)} is VALID [2022-04-28 13:55:39,017 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2836#true} {3065#(< ~counter~0 9)} #63#return; {3065#(< ~counter~0 9)} is VALID [2022-04-28 13:55:39,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:55:39,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:55:39,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:55:39,017 INFO L272 TraceCheckUtils]: 37: Hoare triple {3065#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:55:39,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {3065#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {3065#(< ~counter~0 9)} is VALID [2022-04-28 13:55:39,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {3093#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3065#(< ~counter~0 9)} is VALID [2022-04-28 13:55:39,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {3093#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3093#(< ~counter~0 8)} is VALID [2022-04-28 13:55:39,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {3093#(< ~counter~0 8)} assume !!(0 != ~y3~0); {3093#(< ~counter~0 8)} is VALID [2022-04-28 13:55:39,019 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2836#true} {3093#(< ~counter~0 8)} #63#return; {3093#(< ~counter~0 8)} is VALID [2022-04-28 13:55:39,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:55:39,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:55:39,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:55:39,019 INFO L272 TraceCheckUtils]: 28: Hoare triple {3093#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:55:39,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {3093#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {3093#(< ~counter~0 8)} is VALID [2022-04-28 13:55:39,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {3121#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3093#(< ~counter~0 8)} is VALID [2022-04-28 13:55:39,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {3121#(< ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3121#(< ~counter~0 7)} is VALID [2022-04-28 13:55:39,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {3121#(< ~counter~0 7)} assume !!(0 != ~y3~0); {3121#(< ~counter~0 7)} is VALID [2022-04-28 13:55:39,021 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2836#true} {3121#(< ~counter~0 7)} #63#return; {3121#(< ~counter~0 7)} is VALID [2022-04-28 13:55:39,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:55:39,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:55:39,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:55:39,021 INFO L272 TraceCheckUtils]: 19: Hoare triple {3121#(< ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:55:39,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {3121#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {3121#(< ~counter~0 7)} is VALID [2022-04-28 13:55:39,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {3149#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3121#(< ~counter~0 7)} is VALID [2022-04-28 13:55:39,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {3149#(< ~counter~0 6)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3149#(< ~counter~0 6)} is VALID [2022-04-28 13:55:39,024 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2836#true} {3149#(< ~counter~0 6)} #61#return; {3149#(< ~counter~0 6)} is VALID [2022-04-28 13:55:39,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:55:39,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:55:39,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:55:39,024 INFO L272 TraceCheckUtils]: 11: Hoare triple {3149#(< ~counter~0 6)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:55:39,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2836#true} {3149#(< ~counter~0 6)} #59#return; {3149#(< ~counter~0 6)} is VALID [2022-04-28 13:55:39,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:55:39,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:55:39,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:55:39,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {3149#(< ~counter~0 6)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:55:39,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {3149#(< ~counter~0 6)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3149#(< ~counter~0 6)} is VALID [2022-04-28 13:55:39,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {3149#(< ~counter~0 6)} call #t~ret7 := main(); {3149#(< ~counter~0 6)} is VALID [2022-04-28 13:55:39,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3149#(< ~counter~0 6)} {2836#true} #67#return; {3149#(< ~counter~0 6)} is VALID [2022-04-28 13:55:39,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {3149#(< ~counter~0 6)} assume true; {3149#(< ~counter~0 6)} is VALID [2022-04-28 13:55:39,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3149#(< ~counter~0 6)} is VALID [2022-04-28 13:55:39,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2836#true} is VALID [2022-04-28 13:55:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 13:55:39,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:39,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935592835] [2022-04-28 13:55:39,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:39,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056049007] [2022-04-28 13:55:39,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056049007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:39,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:39,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 13:55:39,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:39,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [863648515] [2022-04-28 13:55:39,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [863648515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:39,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:39,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:55:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254829001] [2022-04-28 13:55:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:39,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 13:55:39,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:39,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:55:39,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:39,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:55:39,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:55:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:55:39,066 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:55:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:39,252 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-28 13:55:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 13:55:39,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 13:55:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:55:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 13:55:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:55:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 13:55:39,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-28 13:55:39,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:39,307 INFO L225 Difference]: With dead ends: 70 [2022-04-28 13:55:39,307 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 13:55:39,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:55:39,308 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:39,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 13:55:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 13:55:39,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:39,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:55:39,375 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:55:39,375 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:55:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:39,376 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 13:55:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:55:39,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:39,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:39,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 13:55:39,377 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 13:55:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:39,378 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 13:55:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:55:39,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:39,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:39,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:39,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:55:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-28 13:55:39,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-28 13:55:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:39,380 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-28 13:55:39,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:55:39,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-28 13:55:39,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:55:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 13:55:39,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:39,447 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:39,482 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 13:55:39,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:39,647 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-28 13:55:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [823014388] [2022-04-28 13:55:39,648 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-28 13:55:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330193514] [2022-04-28 13:55:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:39,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:39,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525946189] [2022-04-28 13:55:39,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:55:39,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:39,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:39,660 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:55:39,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 13:55:39,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:55:39,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:39,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:55:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:39,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:40,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {3611#true} call ULTIMATE.init(); {3611#true} is VALID [2022-04-28 13:55:40,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {3611#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3619#(<= ~counter~0 0)} {3611#true} #67#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {3619#(<= ~counter~0 0)} call #t~ret7 := main(); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {3619#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {3619#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {3619#(<= ~counter~0 0)} ~cond := #in~cond; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {3619#(<= ~counter~0 0)} assume !(0 == ~cond); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3619#(<= ~counter~0 0)} {3619#(<= ~counter~0 0)} #59#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,070 INFO L272 TraceCheckUtils]: 11: Hoare triple {3619#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(<= ~counter~0 0)} ~cond := #in~cond; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(<= ~counter~0 0)} assume !(0 == ~cond); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,071 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3619#(<= ~counter~0 0)} {3619#(<= ~counter~0 0)} #61#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {3619#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:40,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {3619#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {3668#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,072 INFO L272 TraceCheckUtils]: 19: Hoare triple {3668#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {3668#(<= ~counter~0 1)} ~cond := #in~cond; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {3668#(<= ~counter~0 1)} assume !(0 == ~cond); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {3668#(<= ~counter~0 1)} assume true; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,074 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3668#(<= ~counter~0 1)} {3668#(<= ~counter~0 1)} #63#return; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {3668#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {3668#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:40,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {3668#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {3696#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,075 INFO L272 TraceCheckUtils]: 28: Hoare triple {3696#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {3696#(<= ~counter~0 2)} ~cond := #in~cond; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {3696#(<= ~counter~0 2)} assume !(0 == ~cond); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {3696#(<= ~counter~0 2)} assume true; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,076 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3696#(<= ~counter~0 2)} {3696#(<= ~counter~0 2)} #63#return; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {3696#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {3696#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:40,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {3696#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {3724#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,078 INFO L272 TraceCheckUtils]: 37: Hoare triple {3724#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {3724#(<= ~counter~0 3)} ~cond := #in~cond; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {3724#(<= ~counter~0 3)} assume !(0 == ~cond); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {3724#(<= ~counter~0 3)} assume true; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,079 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3724#(<= ~counter~0 3)} {3724#(<= ~counter~0 3)} #63#return; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {3724#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {3724#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:40,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {3724#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {3752#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,081 INFO L272 TraceCheckUtils]: 46: Hoare triple {3752#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {3752#(<= ~counter~0 4)} ~cond := #in~cond; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {3752#(<= ~counter~0 4)} assume !(0 == ~cond); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {3752#(<= ~counter~0 4)} assume true; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,082 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3752#(<= ~counter~0 4)} {3752#(<= ~counter~0 4)} #63#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {3752#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {3752#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {3752#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,084 INFO L290 TraceCheckUtils]: 54: Hoare triple {3780#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,084 INFO L272 TraceCheckUtils]: 55: Hoare triple {3780#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {3780#(<= ~counter~0 5)} ~cond := #in~cond; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {3780#(<= ~counter~0 5)} assume !(0 == ~cond); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {3780#(<= ~counter~0 5)} assume true; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,086 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3780#(<= ~counter~0 5)} {3780#(<= ~counter~0 5)} #63#return; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {3780#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {3780#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {3780#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3808#(<= |main_#t~post6| 5)} is VALID [2022-04-28 13:55:40,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {3808#(<= |main_#t~post6| 5)} assume !(#t~post6 < 10);havoc #t~post6; {3612#false} is VALID [2022-04-28 13:55:40,087 INFO L272 TraceCheckUtils]: 64: Hoare triple {3612#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {3612#false} is VALID [2022-04-28 13:55:40,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {3612#false} ~cond := #in~cond; {3612#false} is VALID [2022-04-28 13:55:40,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {3612#false} assume 0 == ~cond; {3612#false} is VALID [2022-04-28 13:55:40,087 INFO L290 TraceCheckUtils]: 67: Hoare triple {3612#false} assume !false; {3612#false} is VALID [2022-04-28 13:55:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:40,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:40,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {3612#false} assume !false; {3612#false} is VALID [2022-04-28 13:55:40,392 INFO L290 TraceCheckUtils]: 66: Hoare triple {3612#false} assume 0 == ~cond; {3612#false} is VALID [2022-04-28 13:55:40,392 INFO L290 TraceCheckUtils]: 65: Hoare triple {3612#false} ~cond := #in~cond; {3612#false} is VALID [2022-04-28 13:55:40,392 INFO L272 TraceCheckUtils]: 64: Hoare triple {3612#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {3612#false} is VALID [2022-04-28 13:55:40,392 INFO L290 TraceCheckUtils]: 63: Hoare triple {3836#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {3612#false} is VALID [2022-04-28 13:55:40,395 INFO L290 TraceCheckUtils]: 62: Hoare triple {3840#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3836#(< |main_#t~post6| 10)} is VALID [2022-04-28 13:55:40,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {3840#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3840#(< ~counter~0 10)} is VALID [2022-04-28 13:55:40,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {3840#(< ~counter~0 10)} assume !!(0 != ~y3~0); {3840#(< ~counter~0 10)} is VALID [2022-04-28 13:55:40,397 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3611#true} {3840#(< ~counter~0 10)} #63#return; {3840#(< ~counter~0 10)} is VALID [2022-04-28 13:55:40,397 INFO L290 TraceCheckUtils]: 58: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:55:40,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:55:40,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:55:40,397 INFO L272 TraceCheckUtils]: 55: Hoare triple {3840#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:55:40,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {3840#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {3840#(< ~counter~0 10)} is VALID [2022-04-28 13:55:40,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {3868#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3840#(< ~counter~0 10)} is VALID [2022-04-28 13:55:40,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {3868#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3868#(< ~counter~0 9)} is VALID [2022-04-28 13:55:40,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {3868#(< ~counter~0 9)} assume !!(0 != ~y3~0); {3868#(< ~counter~0 9)} is VALID [2022-04-28 13:55:40,399 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3611#true} {3868#(< ~counter~0 9)} #63#return; {3868#(< ~counter~0 9)} is VALID [2022-04-28 13:55:40,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:55:40,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:55:40,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:55:40,399 INFO L272 TraceCheckUtils]: 46: Hoare triple {3868#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:55:40,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {3868#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {3868#(< ~counter~0 9)} is VALID [2022-04-28 13:55:40,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {3896#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3868#(< ~counter~0 9)} is VALID [2022-04-28 13:55:40,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {3896#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3896#(< ~counter~0 8)} is VALID [2022-04-28 13:55:40,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {3896#(< ~counter~0 8)} assume !!(0 != ~y3~0); {3896#(< ~counter~0 8)} is VALID [2022-04-28 13:55:40,401 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3611#true} {3896#(< ~counter~0 8)} #63#return; {3896#(< ~counter~0 8)} is VALID [2022-04-28 13:55:40,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:55:40,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:55:40,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:55:40,401 INFO L272 TraceCheckUtils]: 37: Hoare triple {3896#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:55:40,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {3896#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {3896#(< ~counter~0 8)} is VALID [2022-04-28 13:55:40,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {3924#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3896#(< ~counter~0 8)} is VALID [2022-04-28 13:55:40,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {3924#(< ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3924#(< ~counter~0 7)} is VALID [2022-04-28 13:55:40,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {3924#(< ~counter~0 7)} assume !!(0 != ~y3~0); {3924#(< ~counter~0 7)} is VALID [2022-04-28 13:55:40,403 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3611#true} {3924#(< ~counter~0 7)} #63#return; {3924#(< ~counter~0 7)} is VALID [2022-04-28 13:55:40,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:55:40,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:55:40,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:55:40,403 INFO L272 TraceCheckUtils]: 28: Hoare triple {3924#(< ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:55:40,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {3924#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {3924#(< ~counter~0 7)} is VALID [2022-04-28 13:55:40,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {3780#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3924#(< ~counter~0 7)} is VALID [2022-04-28 13:55:40,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {3780#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {3780#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,405 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3611#true} {3780#(<= ~counter~0 5)} #63#return; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:55:40,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:55:40,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:55:40,405 INFO L272 TraceCheckUtils]: 19: Hoare triple {3780#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:55:40,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {3780#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {3752#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:40,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {3752#(<= ~counter~0 4)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,406 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3611#true} {3752#(<= ~counter~0 4)} #61#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:55:40,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:55:40,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:55:40,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {3752#(<= ~counter~0 4)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:55:40,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3611#true} {3752#(<= ~counter~0 4)} #59#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:55:40,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:55:40,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:55:40,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {3752#(<= ~counter~0 4)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:55:40,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {3752#(<= ~counter~0 4)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {3752#(<= ~counter~0 4)} call #t~ret7 := main(); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3752#(<= ~counter~0 4)} {3611#true} #67#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3752#(<= ~counter~0 4)} assume true; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {3611#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:40,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {3611#true} call ULTIMATE.init(); {3611#true} is VALID [2022-04-28 13:55:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 13:55:40,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:40,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330193514] [2022-04-28 13:55:40,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:40,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525946189] [2022-04-28 13:55:40,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525946189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:40,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:40,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 13:55:40,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:40,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [823014388] [2022-04-28 13:55:40,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [823014388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:40,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:40,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 13:55:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308900746] [2022-04-28 13:55:40,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:40,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-04-28 13:55:40,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:40,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:55:40,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:40,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 13:55:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:40,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 13:55:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:55:40,464 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:55:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:40,701 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-28 13:55:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 13:55:40,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-04-28 13:55:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:55:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 13:55:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:55:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 13:55:40,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 85 transitions. [2022-04-28 13:55:40,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:40,756 INFO L225 Difference]: With dead ends: 79 [2022-04-28 13:55:40,756 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 13:55:40,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-28 13:55:40,757 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:40,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 13:55:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 13:55:40,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:40,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:55:40,826 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:55:40,826 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:55:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:40,828 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-28 13:55:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 13:55:40,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:40,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:40,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 13:55:40,828 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 13:55:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:40,830 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-28 13:55:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 13:55:40,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:40,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:40,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:40,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:55:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-04-28 13:55:40,831 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 68 [2022-04-28 13:55:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:40,832 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-04-28 13:55:40,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:55:40,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2022-04-28 13:55:40,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 13:55:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 13:55:40,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:40,922 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:40,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 13:55:41,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 13:55:41,123 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:41,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 11 times [2022-04-28 13:55:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:41,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1121716719] [2022-04-28 13:55:41,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 12 times [2022-04-28 13:55:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:41,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338574042] [2022-04-28 13:55:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:41,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:41,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:41,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671606794] [2022-04-28 13:55:41,155 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:55:41,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:41,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:41,156 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:55:41,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 13:55:41,207 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 13:55:41,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:41,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 13:55:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:41,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:41,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2022-04-28 13:55:41,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {4496#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {4504#(<= ~counter~0 0)} assume true; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4504#(<= ~counter~0 0)} {4496#true} #67#return; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {4504#(<= ~counter~0 0)} call #t~ret7 := main(); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {4504#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {4504#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {4504#(<= ~counter~0 0)} ~cond := #in~cond; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {4504#(<= ~counter~0 0)} assume !(0 == ~cond); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {4504#(<= ~counter~0 0)} assume true; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,574 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4504#(<= ~counter~0 0)} {4504#(<= ~counter~0 0)} #59#return; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,574 INFO L272 TraceCheckUtils]: 11: Hoare triple {4504#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {4504#(<= ~counter~0 0)} ~cond := #in~cond; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {4504#(<= ~counter~0 0)} assume !(0 == ~cond); {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {4504#(<= ~counter~0 0)} assume true; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,575 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4504#(<= ~counter~0 0)} {4504#(<= ~counter~0 0)} #61#return; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {4504#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {4504#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:41,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {4504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {4553#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,577 INFO L272 TraceCheckUtils]: 19: Hoare triple {4553#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {4553#(<= ~counter~0 1)} ~cond := #in~cond; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {4553#(<= ~counter~0 1)} assume !(0 == ~cond); {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {4553#(<= ~counter~0 1)} assume true; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,578 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4553#(<= ~counter~0 1)} {4553#(<= ~counter~0 1)} #63#return; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {4553#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {4553#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4553#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:41,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {4553#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {4581#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,579 INFO L272 TraceCheckUtils]: 28: Hoare triple {4581#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {4581#(<= ~counter~0 2)} ~cond := #in~cond; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {4581#(<= ~counter~0 2)} assume !(0 == ~cond); {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {4581#(<= ~counter~0 2)} assume true; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,580 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4581#(<= ~counter~0 2)} {4581#(<= ~counter~0 2)} #63#return; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {4581#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {4581#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4581#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:41,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {4581#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {4609#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,582 INFO L272 TraceCheckUtils]: 37: Hoare triple {4609#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {4609#(<= ~counter~0 3)} ~cond := #in~cond; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {4609#(<= ~counter~0 3)} assume !(0 == ~cond); {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {4609#(<= ~counter~0 3)} assume true; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,583 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4609#(<= ~counter~0 3)} {4609#(<= ~counter~0 3)} #63#return; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {4609#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {4609#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {4609#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {4637#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,585 INFO L272 TraceCheckUtils]: 46: Hoare triple {4637#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,585 INFO L290 TraceCheckUtils]: 47: Hoare triple {4637#(<= ~counter~0 4)} ~cond := #in~cond; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {4637#(<= ~counter~0 4)} assume !(0 == ~cond); {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {4637#(<= ~counter~0 4)} assume true; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,586 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4637#(<= ~counter~0 4)} {4637#(<= ~counter~0 4)} #63#return; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {4637#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {4637#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {4637#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {4665#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,588 INFO L272 TraceCheckUtils]: 55: Hoare triple {4665#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {4665#(<= ~counter~0 5)} ~cond := #in~cond; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {4665#(<= ~counter~0 5)} assume !(0 == ~cond); {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {4665#(<= ~counter~0 5)} assume true; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,589 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4665#(<= ~counter~0 5)} {4665#(<= ~counter~0 5)} #63#return; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {4665#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,589 INFO L290 TraceCheckUtils]: 61: Hoare triple {4665#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {4665#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,590 INFO L290 TraceCheckUtils]: 63: Hoare triple {4693#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,590 INFO L272 TraceCheckUtils]: 64: Hoare triple {4693#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {4693#(<= ~counter~0 6)} ~cond := #in~cond; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {4693#(<= ~counter~0 6)} assume !(0 == ~cond); {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,591 INFO L290 TraceCheckUtils]: 67: Hoare triple {4693#(<= ~counter~0 6)} assume true; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,592 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4693#(<= ~counter~0 6)} {4693#(<= ~counter~0 6)} #63#return; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {4693#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {4693#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,592 INFO L290 TraceCheckUtils]: 71: Hoare triple {4693#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4721#(<= |main_#t~post6| 6)} is VALID [2022-04-28 13:55:41,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {4721#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {4497#false} is VALID [2022-04-28 13:55:41,593 INFO L272 TraceCheckUtils]: 73: Hoare triple {4497#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {4497#false} is VALID [2022-04-28 13:55:41,593 INFO L290 TraceCheckUtils]: 74: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2022-04-28 13:55:41,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {4497#false} assume 0 == ~cond; {4497#false} is VALID [2022-04-28 13:55:41,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2022-04-28 13:55:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 147 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:41,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:41,922 INFO L290 TraceCheckUtils]: 76: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2022-04-28 13:55:41,922 INFO L290 TraceCheckUtils]: 75: Hoare triple {4497#false} assume 0 == ~cond; {4497#false} is VALID [2022-04-28 13:55:41,922 INFO L290 TraceCheckUtils]: 74: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2022-04-28 13:55:41,922 INFO L272 TraceCheckUtils]: 73: Hoare triple {4497#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {4497#false} is VALID [2022-04-28 13:55:41,922 INFO L290 TraceCheckUtils]: 72: Hoare triple {4749#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {4497#false} is VALID [2022-04-28 13:55:41,923 INFO L290 TraceCheckUtils]: 71: Hoare triple {4753#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4749#(< |main_#t~post6| 10)} is VALID [2022-04-28 13:55:41,923 INFO L290 TraceCheckUtils]: 70: Hoare triple {4753#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4753#(< ~counter~0 10)} is VALID [2022-04-28 13:55:41,923 INFO L290 TraceCheckUtils]: 69: Hoare triple {4753#(< ~counter~0 10)} assume !!(0 != ~y3~0); {4753#(< ~counter~0 10)} is VALID [2022-04-28 13:55:41,924 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4496#true} {4753#(< ~counter~0 10)} #63#return; {4753#(< ~counter~0 10)} is VALID [2022-04-28 13:55:41,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 13:55:41,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 13:55:41,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 13:55:41,924 INFO L272 TraceCheckUtils]: 64: Hoare triple {4753#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 13:55:41,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {4753#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {4753#(< ~counter~0 10)} is VALID [2022-04-28 13:55:41,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {4781#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4753#(< ~counter~0 10)} is VALID [2022-04-28 13:55:41,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {4781#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4781#(< ~counter~0 9)} is VALID [2022-04-28 13:55:41,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {4781#(< ~counter~0 9)} assume !!(0 != ~y3~0); {4781#(< ~counter~0 9)} is VALID [2022-04-28 13:55:41,926 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4496#true} {4781#(< ~counter~0 9)} #63#return; {4781#(< ~counter~0 9)} is VALID [2022-04-28 13:55:41,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 13:55:41,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 13:55:41,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 13:55:41,926 INFO L272 TraceCheckUtils]: 55: Hoare triple {4781#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 13:55:41,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {4781#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {4781#(< ~counter~0 9)} is VALID [2022-04-28 13:55:41,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {4809#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4781#(< ~counter~0 9)} is VALID [2022-04-28 13:55:41,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {4809#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4809#(< ~counter~0 8)} is VALID [2022-04-28 13:55:41,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {4809#(< ~counter~0 8)} assume !!(0 != ~y3~0); {4809#(< ~counter~0 8)} is VALID [2022-04-28 13:55:41,927 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4496#true} {4809#(< ~counter~0 8)} #63#return; {4809#(< ~counter~0 8)} is VALID [2022-04-28 13:55:41,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 13:55:41,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 13:55:41,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 13:55:41,928 INFO L272 TraceCheckUtils]: 46: Hoare triple {4809#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 13:55:41,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {4809#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {4809#(< ~counter~0 8)} is VALID [2022-04-28 13:55:41,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {4693#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4809#(< ~counter~0 8)} is VALID [2022-04-28 13:55:41,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {4693#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {4693#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,929 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4496#true} {4693#(<= ~counter~0 6)} #63#return; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 13:55:41,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 13:55:41,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 13:55:41,930 INFO L272 TraceCheckUtils]: 37: Hoare triple {4693#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 13:55:41,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {4693#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {4665#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4693#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:41,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {4665#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {4665#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,931 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4496#true} {4665#(<= ~counter~0 5)} #63#return; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 13:55:41,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 13:55:41,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 13:55:41,931 INFO L272 TraceCheckUtils]: 28: Hoare triple {4665#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 13:55:41,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {4665#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {4637#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4665#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:41,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {4637#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {4637#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,949 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4496#true} {4637#(<= ~counter~0 4)} #63#return; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 13:55:41,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 13:55:41,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 13:55:41,949 INFO L272 TraceCheckUtils]: 19: Hoare triple {4637#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 13:55:41,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {4637#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {4609#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4637#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:41,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {4609#(<= ~counter~0 3)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,950 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4496#true} {4609#(<= ~counter~0 3)} #61#return; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 13:55:41,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 13:55:41,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 13:55:41,951 INFO L272 TraceCheckUtils]: 11: Hoare triple {4609#(<= ~counter~0 3)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {4496#true} is VALID [2022-04-28 13:55:41,951 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4496#true} {4609#(<= ~counter~0 3)} #59#return; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-04-28 13:55:41,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {4496#true} assume !(0 == ~cond); {4496#true} is VALID [2022-04-28 13:55:41,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2022-04-28 13:55:41,951 INFO L272 TraceCheckUtils]: 6: Hoare triple {4609#(<= ~counter~0 3)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {4496#true} is VALID [2022-04-28 13:55:41,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#(<= ~counter~0 3)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {4609#(<= ~counter~0 3)} call #t~ret7 := main(); {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4609#(<= ~counter~0 3)} {4496#true} #67#return; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {4609#(<= ~counter~0 3)} assume true; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {4496#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4609#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:41,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2022-04-28 13:55:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 13:55:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:41,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338574042] [2022-04-28 13:55:41,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:41,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671606794] [2022-04-28 13:55:41,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671606794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:41,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:41,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 13:55:41,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:41,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1121716719] [2022-04-28 13:55:41,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1121716719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:41,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:41,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:55:41,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316607012] [2022-04-28 13:55:41,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2022-04-28 13:55:41,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:41,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:55:42,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:42,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:55:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:55:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:55:42,003 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:55:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:42,270 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-28 13:55:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 13:55:42,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2022-04-28 13:55:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:55:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-28 13:55:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:55:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-28 13:55:42,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 95 transitions. [2022-04-28 13:55:42,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:42,332 INFO L225 Difference]: With dead ends: 88 [2022-04-28 13:55:42,332 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 13:55:42,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-28 13:55:42,333 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:42,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 124 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 13:55:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 13:55:42,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:42,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 13:55:42,396 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 13:55:42,396 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 13:55:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:42,398 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 13:55:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 13:55:42,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:42,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:42,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-04-28 13:55:42,398 INFO L87 Difference]: Start difference. First operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-04-28 13:55:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:42,400 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 13:55:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 13:55:42,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:42,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:42,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:42,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 13:55:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-04-28 13:55:42,401 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 77 [2022-04-28 13:55:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:42,402 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-04-28 13:55:42,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:55:42,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 91 transitions. [2022-04-28 13:55:42,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 13:55:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 13:55:42,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:42,485 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:42,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 13:55:42,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 13:55:42,691 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 13 times [2022-04-28 13:55:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:42,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950437253] [2022-04-28 13:55:42,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 14 times [2022-04-28 13:55:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:42,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341451936] [2022-04-28 13:55:42,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:42,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:42,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:42,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635756478] [2022-04-28 13:55:42,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:55:42,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:42,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:42,706 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:55:42,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 13:55:42,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:55:42,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:42,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 13:55:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:42,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:43,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {5491#true} call ULTIMATE.init(); {5491#true} is VALID [2022-04-28 13:55:43,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {5491#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {5499#(<= ~counter~0 0)} assume true; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5499#(<= ~counter~0 0)} {5491#true} #67#return; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {5499#(<= ~counter~0 0)} call #t~ret7 := main(); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {5499#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {5499#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {5499#(<= ~counter~0 0)} ~cond := #in~cond; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {5499#(<= ~counter~0 0)} assume !(0 == ~cond); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {5499#(<= ~counter~0 0)} assume true; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,143 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5499#(<= ~counter~0 0)} {5499#(<= ~counter~0 0)} #59#return; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,143 INFO L272 TraceCheckUtils]: 11: Hoare triple {5499#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {5499#(<= ~counter~0 0)} ~cond := #in~cond; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {5499#(<= ~counter~0 0)} assume !(0 == ~cond); {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {5499#(<= ~counter~0 0)} assume true; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,144 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5499#(<= ~counter~0 0)} {5499#(<= ~counter~0 0)} #61#return; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {5499#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {5499#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:43,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {5499#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {5548#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,146 INFO L272 TraceCheckUtils]: 19: Hoare triple {5548#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {5548#(<= ~counter~0 1)} ~cond := #in~cond; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {5548#(<= ~counter~0 1)} assume !(0 == ~cond); {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {5548#(<= ~counter~0 1)} assume true; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,148 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5548#(<= ~counter~0 1)} {5548#(<= ~counter~0 1)} #63#return; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {5548#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {5548#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5548#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:43,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {5548#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {5576#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,150 INFO L272 TraceCheckUtils]: 28: Hoare triple {5576#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {5576#(<= ~counter~0 2)} ~cond := #in~cond; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {5576#(<= ~counter~0 2)} assume !(0 == ~cond); {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {5576#(<= ~counter~0 2)} assume true; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,151 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5576#(<= ~counter~0 2)} {5576#(<= ~counter~0 2)} #63#return; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {5576#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {5576#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {5576#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {5604#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,155 INFO L272 TraceCheckUtils]: 37: Hoare triple {5604#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {5604#(<= ~counter~0 3)} ~cond := #in~cond; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {5604#(<= ~counter~0 3)} assume !(0 == ~cond); {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {5604#(<= ~counter~0 3)} assume true; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,164 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5604#(<= ~counter~0 3)} {5604#(<= ~counter~0 3)} #63#return; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {5604#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {5604#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {5604#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {5632#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,166 INFO L272 TraceCheckUtils]: 46: Hoare triple {5632#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {5632#(<= ~counter~0 4)} ~cond := #in~cond; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {5632#(<= ~counter~0 4)} assume !(0 == ~cond); {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {5632#(<= ~counter~0 4)} assume true; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,167 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5632#(<= ~counter~0 4)} {5632#(<= ~counter~0 4)} #63#return; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {5632#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {5632#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {5632#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {5660#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,169 INFO L272 TraceCheckUtils]: 55: Hoare triple {5660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {5660#(<= ~counter~0 5)} ~cond := #in~cond; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {5660#(<= ~counter~0 5)} assume !(0 == ~cond); {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {5660#(<= ~counter~0 5)} assume true; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,170 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5660#(<= ~counter~0 5)} {5660#(<= ~counter~0 5)} #63#return; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,171 INFO L290 TraceCheckUtils]: 60: Hoare triple {5660#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {5660#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {5660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {5688#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,172 INFO L272 TraceCheckUtils]: 64: Hoare triple {5688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {5688#(<= ~counter~0 6)} ~cond := #in~cond; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {5688#(<= ~counter~0 6)} assume !(0 == ~cond); {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,173 INFO L290 TraceCheckUtils]: 67: Hoare triple {5688#(<= ~counter~0 6)} assume true; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,173 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5688#(<= ~counter~0 6)} {5688#(<= ~counter~0 6)} #63#return; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,174 INFO L290 TraceCheckUtils]: 69: Hoare triple {5688#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,174 INFO L290 TraceCheckUtils]: 70: Hoare triple {5688#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,174 INFO L290 TraceCheckUtils]: 71: Hoare triple {5688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {5716#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,175 INFO L272 TraceCheckUtils]: 73: Hoare triple {5716#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,175 INFO L290 TraceCheckUtils]: 74: Hoare triple {5716#(<= ~counter~0 7)} ~cond := #in~cond; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,176 INFO L290 TraceCheckUtils]: 75: Hoare triple {5716#(<= ~counter~0 7)} assume !(0 == ~cond); {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,176 INFO L290 TraceCheckUtils]: 76: Hoare triple {5716#(<= ~counter~0 7)} assume true; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,177 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5716#(<= ~counter~0 7)} {5716#(<= ~counter~0 7)} #63#return; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,177 INFO L290 TraceCheckUtils]: 78: Hoare triple {5716#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,177 INFO L290 TraceCheckUtils]: 79: Hoare triple {5716#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {5716#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5744#(<= |main_#t~post6| 7)} is VALID [2022-04-28 13:55:43,178 INFO L290 TraceCheckUtils]: 81: Hoare triple {5744#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {5492#false} is VALID [2022-04-28 13:55:43,178 INFO L272 TraceCheckUtils]: 82: Hoare triple {5492#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {5492#false} is VALID [2022-04-28 13:55:43,178 INFO L290 TraceCheckUtils]: 83: Hoare triple {5492#false} ~cond := #in~cond; {5492#false} is VALID [2022-04-28 13:55:43,178 INFO L290 TraceCheckUtils]: 84: Hoare triple {5492#false} assume 0 == ~cond; {5492#false} is VALID [2022-04-28 13:55:43,178 INFO L290 TraceCheckUtils]: 85: Hoare triple {5492#false} assume !false; {5492#false} is VALID [2022-04-28 13:55:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 14 proven. 203 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:43,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:43,535 INFO L290 TraceCheckUtils]: 85: Hoare triple {5492#false} assume !false; {5492#false} is VALID [2022-04-28 13:55:43,536 INFO L290 TraceCheckUtils]: 84: Hoare triple {5492#false} assume 0 == ~cond; {5492#false} is VALID [2022-04-28 13:55:43,536 INFO L290 TraceCheckUtils]: 83: Hoare triple {5492#false} ~cond := #in~cond; {5492#false} is VALID [2022-04-28 13:55:43,536 INFO L272 TraceCheckUtils]: 82: Hoare triple {5492#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {5492#false} is VALID [2022-04-28 13:55:43,536 INFO L290 TraceCheckUtils]: 81: Hoare triple {5772#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {5492#false} is VALID [2022-04-28 13:55:43,536 INFO L290 TraceCheckUtils]: 80: Hoare triple {5776#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5772#(< |main_#t~post6| 10)} is VALID [2022-04-28 13:55:43,536 INFO L290 TraceCheckUtils]: 79: Hoare triple {5776#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5776#(< ~counter~0 10)} is VALID [2022-04-28 13:55:43,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {5776#(< ~counter~0 10)} assume !!(0 != ~y3~0); {5776#(< ~counter~0 10)} is VALID [2022-04-28 13:55:43,537 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5491#true} {5776#(< ~counter~0 10)} #63#return; {5776#(< ~counter~0 10)} is VALID [2022-04-28 13:55:43,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,538 INFO L272 TraceCheckUtils]: 73: Hoare triple {5776#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {5776#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {5776#(< ~counter~0 10)} is VALID [2022-04-28 13:55:43,538 INFO L290 TraceCheckUtils]: 71: Hoare triple {5804#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5776#(< ~counter~0 10)} is VALID [2022-04-28 13:55:43,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {5804#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5804#(< ~counter~0 9)} is VALID [2022-04-28 13:55:43,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {5804#(< ~counter~0 9)} assume !!(0 != ~y3~0); {5804#(< ~counter~0 9)} is VALID [2022-04-28 13:55:43,539 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5491#true} {5804#(< ~counter~0 9)} #63#return; {5804#(< ~counter~0 9)} is VALID [2022-04-28 13:55:43,539 INFO L290 TraceCheckUtils]: 67: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,540 INFO L272 TraceCheckUtils]: 64: Hoare triple {5804#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,540 INFO L290 TraceCheckUtils]: 63: Hoare triple {5804#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {5804#(< ~counter~0 9)} is VALID [2022-04-28 13:55:43,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {5716#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5804#(< ~counter~0 9)} is VALID [2022-04-28 13:55:43,540 INFO L290 TraceCheckUtils]: 61: Hoare triple {5716#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {5716#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,541 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5491#true} {5716#(<= ~counter~0 7)} #63#return; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,541 INFO L272 TraceCheckUtils]: 55: Hoare triple {5716#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {5716#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {5688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5716#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:43,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {5688#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,542 INFO L290 TraceCheckUtils]: 51: Hoare triple {5688#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,543 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5491#true} {5688#(<= ~counter~0 6)} #63#return; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,543 INFO L290 TraceCheckUtils]: 49: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,543 INFO L272 TraceCheckUtils]: 46: Hoare triple {5688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {5688#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {5660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5688#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:43,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {5660#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {5660#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,555 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5491#true} {5660#(<= ~counter~0 5)} #63#return; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,555 INFO L272 TraceCheckUtils]: 37: Hoare triple {5660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {5660#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {5632#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5660#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:43,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {5632#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {5632#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,559 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5491#true} {5632#(<= ~counter~0 4)} #63#return; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,559 INFO L272 TraceCheckUtils]: 28: Hoare triple {5632#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {5632#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {5604#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5632#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:43,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {5604#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {5604#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,561 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5491#true} {5604#(<= ~counter~0 3)} #63#return; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,561 INFO L272 TraceCheckUtils]: 19: Hoare triple {5604#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {5604#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {5576#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5604#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:43,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {5576#(<= ~counter~0 2)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,576 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5491#true} {5576#(<= ~counter~0 2)} #61#return; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {5576#(<= ~counter~0 2)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5491#true} {5576#(<= ~counter~0 2)} #59#return; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {5491#true} assume true; {5491#true} is VALID [2022-04-28 13:55:43,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {5491#true} assume !(0 == ~cond); {5491#true} is VALID [2022-04-28 13:55:43,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {5491#true} ~cond := #in~cond; {5491#true} is VALID [2022-04-28 13:55:43,577 INFO L272 TraceCheckUtils]: 6: Hoare triple {5576#(<= ~counter~0 2)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {5491#true} is VALID [2022-04-28 13:55:43,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {5576#(<= ~counter~0 2)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {5576#(<= ~counter~0 2)} call #t~ret7 := main(); {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5576#(<= ~counter~0 2)} {5491#true} #67#return; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {5576#(<= ~counter~0 2)} assume true; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {5491#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5576#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:43,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {5491#true} call ULTIMATE.init(); {5491#true} is VALID [2022-04-28 13:55:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 14 proven. 119 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 13:55:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:43,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341451936] [2022-04-28 13:55:43,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:43,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635756478] [2022-04-28 13:55:43,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635756478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:43,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:43,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 13:55:43,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:43,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950437253] [2022-04-28 13:55:43,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950437253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:43,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:43,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 13:55:43,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532543794] [2022-04-28 13:55:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 86 [2022-04-28 13:55:43,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:43,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:55:43,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:43,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 13:55:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 13:55:43,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:55:43,633 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:55:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:43,902 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-04-28 13:55:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 13:55:43,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 86 [2022-04-28 13:55:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:55:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-28 13:55:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:55:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-28 13:55:43,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 105 transitions. [2022-04-28 13:55:43,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:43,984 INFO L225 Difference]: With dead ends: 97 [2022-04-28 13:55:43,984 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 13:55:43,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-28 13:55:43,985 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:43,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 132 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 13:55:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 13:55:44,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:44,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 13:55:44,065 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 13:55:44,065 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 13:55:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:44,067 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 13:55:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 13:55:44,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:44,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:44,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-04-28 13:55:44,067 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-04-28 13:55:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:44,069 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 13:55:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 13:55:44,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:44,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:44,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:44,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 13:55:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-04-28 13:55:44,070 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 86 [2022-04-28 13:55:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:44,070 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-04-28 13:55:44,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:55:44,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 101 transitions. [2022-04-28 13:55:44,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 13:55:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 13:55:44,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:44,170 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:44,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 13:55:44,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 13:55:44,371 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 15 times [2022-04-28 13:55:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:44,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545688596] [2022-04-28 13:55:44,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 16 times [2022-04-28 13:55:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:44,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968089064] [2022-04-28 13:55:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:44,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:44,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459831568] [2022-04-28 13:55:44,383 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:55:44,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:44,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:44,384 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:55:44,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 13:55:44,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:55:44,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:44,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 13:55:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:44,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:44,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {6596#true} call ULTIMATE.init(); {6596#true} is VALID [2022-04-28 13:55:44,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {6596#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {6604#(<= ~counter~0 0)} assume true; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6604#(<= ~counter~0 0)} {6596#true} #67#return; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {6604#(<= ~counter~0 0)} call #t~ret7 := main(); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {6604#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {6604#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {6604#(<= ~counter~0 0)} ~cond := #in~cond; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {6604#(<= ~counter~0 0)} assume !(0 == ~cond); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {6604#(<= ~counter~0 0)} assume true; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6604#(<= ~counter~0 0)} {6604#(<= ~counter~0 0)} #59#return; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,861 INFO L272 TraceCheckUtils]: 11: Hoare triple {6604#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {6604#(<= ~counter~0 0)} ~cond := #in~cond; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {6604#(<= ~counter~0 0)} assume !(0 == ~cond); {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {6604#(<= ~counter~0 0)} assume true; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,862 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6604#(<= ~counter~0 0)} {6604#(<= ~counter~0 0)} #61#return; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {6604#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {6604#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:44,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {6604#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {6653#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,863 INFO L272 TraceCheckUtils]: 19: Hoare triple {6653#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {6653#(<= ~counter~0 1)} ~cond := #in~cond; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {6653#(<= ~counter~0 1)} assume !(0 == ~cond); {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {6653#(<= ~counter~0 1)} assume true; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,864 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6653#(<= ~counter~0 1)} {6653#(<= ~counter~0 1)} #63#return; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {6653#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {6653#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:44,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {6653#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {6681#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,866 INFO L272 TraceCheckUtils]: 28: Hoare triple {6681#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {6681#(<= ~counter~0 2)} ~cond := #in~cond; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {6681#(<= ~counter~0 2)} assume !(0 == ~cond); {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {6681#(<= ~counter~0 2)} assume true; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,867 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6681#(<= ~counter~0 2)} {6681#(<= ~counter~0 2)} #63#return; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {6681#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {6681#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:44,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {6681#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {6709#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,869 INFO L272 TraceCheckUtils]: 37: Hoare triple {6709#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {6709#(<= ~counter~0 3)} ~cond := #in~cond; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {6709#(<= ~counter~0 3)} assume !(0 == ~cond); {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {6709#(<= ~counter~0 3)} assume true; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,870 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6709#(<= ~counter~0 3)} {6709#(<= ~counter~0 3)} #63#return; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {6709#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {6709#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:44,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {6709#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {6737#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,871 INFO L272 TraceCheckUtils]: 46: Hoare triple {6737#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {6737#(<= ~counter~0 4)} ~cond := #in~cond; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {6737#(<= ~counter~0 4)} assume !(0 == ~cond); {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {6737#(<= ~counter~0 4)} assume true; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,873 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6737#(<= ~counter~0 4)} {6737#(<= ~counter~0 4)} #63#return; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {6737#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {6737#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:44,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {6737#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {6765#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,875 INFO L272 TraceCheckUtils]: 55: Hoare triple {6765#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {6765#(<= ~counter~0 5)} ~cond := #in~cond; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {6765#(<= ~counter~0 5)} assume !(0 == ~cond); {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {6765#(<= ~counter~0 5)} assume true; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,876 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6765#(<= ~counter~0 5)} {6765#(<= ~counter~0 5)} #63#return; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {6765#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {6765#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:44,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {6765#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {6793#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,878 INFO L272 TraceCheckUtils]: 64: Hoare triple {6793#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {6793#(<= ~counter~0 6)} ~cond := #in~cond; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {6793#(<= ~counter~0 6)} assume !(0 == ~cond); {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {6793#(<= ~counter~0 6)} assume true; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,879 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6793#(<= ~counter~0 6)} {6793#(<= ~counter~0 6)} #63#return; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {6793#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {6793#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:44,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {6793#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {6821#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,881 INFO L272 TraceCheckUtils]: 73: Hoare triple {6821#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {6821#(<= ~counter~0 7)} ~cond := #in~cond; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {6821#(<= ~counter~0 7)} assume !(0 == ~cond); {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {6821#(<= ~counter~0 7)} assume true; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,882 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6821#(<= ~counter~0 7)} {6821#(<= ~counter~0 7)} #63#return; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,882 INFO L290 TraceCheckUtils]: 78: Hoare triple {6821#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,882 INFO L290 TraceCheckUtils]: 79: Hoare triple {6821#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:44,883 INFO L290 TraceCheckUtils]: 80: Hoare triple {6821#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,883 INFO L290 TraceCheckUtils]: 81: Hoare triple {6849#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,883 INFO L272 TraceCheckUtils]: 82: Hoare triple {6849#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,884 INFO L290 TraceCheckUtils]: 83: Hoare triple {6849#(<= ~counter~0 8)} ~cond := #in~cond; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {6849#(<= ~counter~0 8)} assume !(0 == ~cond); {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {6849#(<= ~counter~0 8)} assume true; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,888 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6849#(<= ~counter~0 8)} {6849#(<= ~counter~0 8)} #63#return; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,889 INFO L290 TraceCheckUtils]: 87: Hoare triple {6849#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,889 INFO L290 TraceCheckUtils]: 88: Hoare triple {6849#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:44,889 INFO L290 TraceCheckUtils]: 89: Hoare triple {6849#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6877#(<= |main_#t~post6| 8)} is VALID [2022-04-28 13:55:44,889 INFO L290 TraceCheckUtils]: 90: Hoare triple {6877#(<= |main_#t~post6| 8)} assume !(#t~post6 < 10);havoc #t~post6; {6597#false} is VALID [2022-04-28 13:55:44,890 INFO L272 TraceCheckUtils]: 91: Hoare triple {6597#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {6597#false} is VALID [2022-04-28 13:55:44,890 INFO L290 TraceCheckUtils]: 92: Hoare triple {6597#false} ~cond := #in~cond; {6597#false} is VALID [2022-04-28 13:55:44,890 INFO L290 TraceCheckUtils]: 93: Hoare triple {6597#false} assume 0 == ~cond; {6597#false} is VALID [2022-04-28 13:55:44,890 INFO L290 TraceCheckUtils]: 94: Hoare triple {6597#false} assume !false; {6597#false} is VALID [2022-04-28 13:55:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 16 proven. 268 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:44,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:45,301 INFO L290 TraceCheckUtils]: 94: Hoare triple {6597#false} assume !false; {6597#false} is VALID [2022-04-28 13:55:45,301 INFO L290 TraceCheckUtils]: 93: Hoare triple {6597#false} assume 0 == ~cond; {6597#false} is VALID [2022-04-28 13:55:45,301 INFO L290 TraceCheckUtils]: 92: Hoare triple {6597#false} ~cond := #in~cond; {6597#false} is VALID [2022-04-28 13:55:45,301 INFO L272 TraceCheckUtils]: 91: Hoare triple {6597#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {6597#false} is VALID [2022-04-28 13:55:45,302 INFO L290 TraceCheckUtils]: 90: Hoare triple {6905#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {6597#false} is VALID [2022-04-28 13:55:45,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {6909#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6905#(< |main_#t~post6| 10)} is VALID [2022-04-28 13:55:45,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {6909#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6909#(< ~counter~0 10)} is VALID [2022-04-28 13:55:45,303 INFO L290 TraceCheckUtils]: 87: Hoare triple {6909#(< ~counter~0 10)} assume !!(0 != ~y3~0); {6909#(< ~counter~0 10)} is VALID [2022-04-28 13:55:45,304 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6596#true} {6909#(< ~counter~0 10)} #63#return; {6909#(< ~counter~0 10)} is VALID [2022-04-28 13:55:45,304 INFO L290 TraceCheckUtils]: 85: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,304 INFO L290 TraceCheckUtils]: 84: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,304 INFO L290 TraceCheckUtils]: 83: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,304 INFO L272 TraceCheckUtils]: 82: Hoare triple {6909#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,304 INFO L290 TraceCheckUtils]: 81: Hoare triple {6909#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {6909#(< ~counter~0 10)} is VALID [2022-04-28 13:55:45,304 INFO L290 TraceCheckUtils]: 80: Hoare triple {6849#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6909#(< ~counter~0 10)} is VALID [2022-04-28 13:55:45,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {6849#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:45,305 INFO L290 TraceCheckUtils]: 78: Hoare triple {6849#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:45,305 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6596#true} {6849#(<= ~counter~0 8)} #63#return; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:45,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,306 INFO L290 TraceCheckUtils]: 75: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,306 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,306 INFO L272 TraceCheckUtils]: 73: Hoare triple {6849#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {6849#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:45,306 INFO L290 TraceCheckUtils]: 71: Hoare triple {6821#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6849#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:45,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {6821#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:45,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {6821#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:45,307 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6596#true} {6821#(<= ~counter~0 7)} #63#return; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:45,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,308 INFO L272 TraceCheckUtils]: 64: Hoare triple {6821#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {6821#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:45,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {6793#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6821#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:45,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {6793#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:45,309 INFO L290 TraceCheckUtils]: 60: Hoare triple {6793#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:45,309 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6596#true} {6793#(<= ~counter~0 6)} #63#return; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:45,309 INFO L290 TraceCheckUtils]: 58: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,309 INFO L290 TraceCheckUtils]: 57: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,309 INFO L272 TraceCheckUtils]: 55: Hoare triple {6793#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {6793#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:45,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {6765#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6793#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:45,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {6765#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:45,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {6765#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:45,311 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6596#true} {6765#(<= ~counter~0 5)} #63#return; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:45,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,311 INFO L272 TraceCheckUtils]: 46: Hoare triple {6765#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {6765#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:45,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {6737#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6765#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:45,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {6737#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:45,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {6737#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:45,313 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6596#true} {6737#(<= ~counter~0 4)} #63#return; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:45,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,313 INFO L272 TraceCheckUtils]: 37: Hoare triple {6737#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {6737#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:45,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {6709#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6737#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:45,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {6709#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:45,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {6709#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:45,314 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6596#true} {6709#(<= ~counter~0 3)} #63#return; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:45,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {6709#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {6709#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:45,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {6681#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6709#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:45,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {6681#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:45,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {6681#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:45,316 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6596#true} {6681#(<= ~counter~0 2)} #63#return; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:45,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,316 INFO L272 TraceCheckUtils]: 19: Hoare triple {6681#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {6681#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:45,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {6653#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6681#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:45,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {6653#(<= ~counter~0 1)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:45,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6596#true} {6653#(<= ~counter~0 1)} #61#return; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:45,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {6653#(<= ~counter~0 1)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6596#true} {6653#(<= ~counter~0 1)} #59#return; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:45,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {6596#true} assume true; {6596#true} is VALID [2022-04-28 13:55:45,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {6596#true} assume !(0 == ~cond); {6596#true} is VALID [2022-04-28 13:55:45,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {6596#true} ~cond := #in~cond; {6596#true} is VALID [2022-04-28 13:55:45,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {6653#(<= ~counter~0 1)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {6596#true} is VALID [2022-04-28 13:55:45,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {6653#(<= ~counter~0 1)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:45,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {6653#(<= ~counter~0 1)} call #t~ret7 := main(); {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:45,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6653#(<= ~counter~0 1)} {6596#true} #67#return; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:45,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {6653#(<= ~counter~0 1)} assume true; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:45,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {6596#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6653#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:45,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {6596#true} call ULTIMATE.init(); {6596#true} is VALID [2022-04-28 13:55:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 16 proven. 156 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 13:55:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:45,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968089064] [2022-04-28 13:55:45,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:45,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459831568] [2022-04-28 13:55:45,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459831568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:45,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:45,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 13:55:45,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:45,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1545688596] [2022-04-28 13:55:45,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1545688596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:45,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:45,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 13:55:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501491993] [2022-04-28 13:55:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 95 [2022-04-28 13:55:45,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:45,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:55:45,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:45,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 13:55:45,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:45,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 13:55:45,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:55:45,388 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:55:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:45,671 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-04-28 13:55:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 13:55:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 95 [2022-04-28 13:55:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:55:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-28 13:55:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:55:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-28 13:55:45,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 115 transitions. [2022-04-28 13:55:45,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:45,756 INFO L225 Difference]: With dead ends: 106 [2022-04-28 13:55:45,756 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 13:55:45,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-28 13:55:45,756 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:45,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 140 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 13:55:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-28 13:55:45,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:45,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:55:45,843 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:55:45,843 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:55:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:45,846 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-28 13:55:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 13:55:45,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:45,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:45,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 101 states. [2022-04-28 13:55:45,848 INFO L87 Difference]: Start difference. First operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 101 states. [2022-04-28 13:55:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:45,849 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-28 13:55:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 13:55:45,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:45,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:45,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:45,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:55:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 13:55:45,856 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 95 [2022-04-28 13:55:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:45,856 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 13:55:45,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:55:45,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 13:55:45,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 13:55:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 13:55:45,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:45,956 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:45,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 13:55:46,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 13:55:46,157 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:46,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 17 times [2022-04-28 13:55:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:46,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795122275] [2022-04-28 13:55:46,158 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 18 times [2022-04-28 13:55:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:46,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826783372] [2022-04-28 13:55:46,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:46,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:46,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66254031] [2022-04-28 13:55:46,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:55:46,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:46,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:46,188 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:55:46,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 13:55:46,254 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 13:55:46,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:55:46,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 13:55:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:55:46,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:55:46,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {7811#true} call ULTIMATE.init(); {7811#true} is VALID [2022-04-28 13:55:46,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {7811#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {7819#(<= ~counter~0 0)} assume true; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7819#(<= ~counter~0 0)} {7811#true} #67#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {7819#(<= ~counter~0 0)} call #t~ret7 := main(); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {7819#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {7819#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {7819#(<= ~counter~0 0)} ~cond := #in~cond; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {7819#(<= ~counter~0 0)} assume !(0 == ~cond); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {7819#(<= ~counter~0 0)} assume true; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7819#(<= ~counter~0 0)} {7819#(<= ~counter~0 0)} #59#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,731 INFO L272 TraceCheckUtils]: 11: Hoare triple {7819#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {7819#(<= ~counter~0 0)} ~cond := #in~cond; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {7819#(<= ~counter~0 0)} assume !(0 == ~cond); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {7819#(<= ~counter~0 0)} assume true; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,732 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7819#(<= ~counter~0 0)} {7819#(<= ~counter~0 0)} #61#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {7819#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:46,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {7819#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {7868#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,734 INFO L272 TraceCheckUtils]: 19: Hoare triple {7868#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {7868#(<= ~counter~0 1)} ~cond := #in~cond; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {7868#(<= ~counter~0 1)} assume !(0 == ~cond); {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {7868#(<= ~counter~0 1)} assume true; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,735 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7868#(<= ~counter~0 1)} {7868#(<= ~counter~0 1)} #63#return; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {7868#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {7868#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:46,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {7896#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,736 INFO L272 TraceCheckUtils]: 28: Hoare triple {7896#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {7896#(<= ~counter~0 2)} ~cond := #in~cond; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {7896#(<= ~counter~0 2)} assume !(0 == ~cond); {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {7896#(<= ~counter~0 2)} assume true; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,738 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7896#(<= ~counter~0 2)} {7896#(<= ~counter~0 2)} #63#return; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {7896#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {7896#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:46,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {7896#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {7924#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,739 INFO L272 TraceCheckUtils]: 37: Hoare triple {7924#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {7924#(<= ~counter~0 3)} ~cond := #in~cond; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {7924#(<= ~counter~0 3)} assume !(0 == ~cond); {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {7924#(<= ~counter~0 3)} assume true; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,740 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7924#(<= ~counter~0 3)} {7924#(<= ~counter~0 3)} #63#return; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {7924#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {7924#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:46,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {7924#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {7952#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,742 INFO L272 TraceCheckUtils]: 46: Hoare triple {7952#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {7952#(<= ~counter~0 4)} ~cond := #in~cond; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {7952#(<= ~counter~0 4)} assume !(0 == ~cond); {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {7952#(<= ~counter~0 4)} assume true; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,744 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7952#(<= ~counter~0 4)} {7952#(<= ~counter~0 4)} #63#return; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {7952#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {7952#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:46,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {7952#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {7980#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,745 INFO L272 TraceCheckUtils]: 55: Hoare triple {7980#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {7980#(<= ~counter~0 5)} ~cond := #in~cond; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {7980#(<= ~counter~0 5)} assume !(0 == ~cond); {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {7980#(<= ~counter~0 5)} assume true; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,748 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7980#(<= ~counter~0 5)} {7980#(<= ~counter~0 5)} #63#return; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {7980#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {7980#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:46,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {7980#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {8008#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,749 INFO L272 TraceCheckUtils]: 64: Hoare triple {8008#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {8008#(<= ~counter~0 6)} ~cond := #in~cond; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {8008#(<= ~counter~0 6)} assume !(0 == ~cond); {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {8008#(<= ~counter~0 6)} assume true; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,750 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8008#(<= ~counter~0 6)} {8008#(<= ~counter~0 6)} #63#return; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,751 INFO L290 TraceCheckUtils]: 69: Hoare triple {8008#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,751 INFO L290 TraceCheckUtils]: 70: Hoare triple {8008#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:46,751 INFO L290 TraceCheckUtils]: 71: Hoare triple {8008#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,751 INFO L290 TraceCheckUtils]: 72: Hoare triple {8036#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,752 INFO L272 TraceCheckUtils]: 73: Hoare triple {8036#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {8036#(<= ~counter~0 7)} ~cond := #in~cond; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,752 INFO L290 TraceCheckUtils]: 75: Hoare triple {8036#(<= ~counter~0 7)} assume !(0 == ~cond); {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,753 INFO L290 TraceCheckUtils]: 76: Hoare triple {8036#(<= ~counter~0 7)} assume true; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,753 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8036#(<= ~counter~0 7)} {8036#(<= ~counter~0 7)} #63#return; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {8036#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,754 INFO L290 TraceCheckUtils]: 79: Hoare triple {8036#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:46,754 INFO L290 TraceCheckUtils]: 80: Hoare triple {8036#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,754 INFO L290 TraceCheckUtils]: 81: Hoare triple {8064#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,755 INFO L272 TraceCheckUtils]: 82: Hoare triple {8064#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,755 INFO L290 TraceCheckUtils]: 83: Hoare triple {8064#(<= ~counter~0 8)} ~cond := #in~cond; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {8064#(<= ~counter~0 8)} assume !(0 == ~cond); {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {8064#(<= ~counter~0 8)} assume true; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,756 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8064#(<= ~counter~0 8)} {8064#(<= ~counter~0 8)} #63#return; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,756 INFO L290 TraceCheckUtils]: 87: Hoare triple {8064#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,756 INFO L290 TraceCheckUtils]: 88: Hoare triple {8064#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:46,757 INFO L290 TraceCheckUtils]: 89: Hoare triple {8064#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,757 INFO L290 TraceCheckUtils]: 90: Hoare triple {8092#(<= ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,757 INFO L272 TraceCheckUtils]: 91: Hoare triple {8092#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,758 INFO L290 TraceCheckUtils]: 92: Hoare triple {8092#(<= ~counter~0 9)} ~cond := #in~cond; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,758 INFO L290 TraceCheckUtils]: 93: Hoare triple {8092#(<= ~counter~0 9)} assume !(0 == ~cond); {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,758 INFO L290 TraceCheckUtils]: 94: Hoare triple {8092#(<= ~counter~0 9)} assume true; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,759 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8092#(<= ~counter~0 9)} {8092#(<= ~counter~0 9)} #63#return; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,759 INFO L290 TraceCheckUtils]: 96: Hoare triple {8092#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,759 INFO L290 TraceCheckUtils]: 97: Hoare triple {8092#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:46,759 INFO L290 TraceCheckUtils]: 98: Hoare triple {8092#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8120#(<= |main_#t~post6| 9)} is VALID [2022-04-28 13:55:46,760 INFO L290 TraceCheckUtils]: 99: Hoare triple {8120#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {7812#false} is VALID [2022-04-28 13:55:46,760 INFO L272 TraceCheckUtils]: 100: Hoare triple {7812#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {7812#false} is VALID [2022-04-28 13:55:46,760 INFO L290 TraceCheckUtils]: 101: Hoare triple {7812#false} ~cond := #in~cond; {7812#false} is VALID [2022-04-28 13:55:46,760 INFO L290 TraceCheckUtils]: 102: Hoare triple {7812#false} assume 0 == ~cond; {7812#false} is VALID [2022-04-28 13:55:46,760 INFO L290 TraceCheckUtils]: 103: Hoare triple {7812#false} assume !false; {7812#false} is VALID [2022-04-28 13:55:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:55:46,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:55:47,147 INFO L290 TraceCheckUtils]: 103: Hoare triple {7812#false} assume !false; {7812#false} is VALID [2022-04-28 13:55:47,147 INFO L290 TraceCheckUtils]: 102: Hoare triple {7812#false} assume 0 == ~cond; {7812#false} is VALID [2022-04-28 13:55:47,147 INFO L290 TraceCheckUtils]: 101: Hoare triple {7812#false} ~cond := #in~cond; {7812#false} is VALID [2022-04-28 13:55:47,147 INFO L272 TraceCheckUtils]: 100: Hoare triple {7812#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {7812#false} is VALID [2022-04-28 13:55:47,148 INFO L290 TraceCheckUtils]: 99: Hoare triple {8120#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {7812#false} is VALID [2022-04-28 13:55:47,148 INFO L290 TraceCheckUtils]: 98: Hoare triple {8092#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8120#(<= |main_#t~post6| 9)} is VALID [2022-04-28 13:55:47,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {8092#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:47,148 INFO L290 TraceCheckUtils]: 96: Hoare triple {8092#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:47,149 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7811#true} {8092#(<= ~counter~0 9)} #63#return; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:47,149 INFO L290 TraceCheckUtils]: 94: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,149 INFO L290 TraceCheckUtils]: 93: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,149 INFO L290 TraceCheckUtils]: 92: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,149 INFO L272 TraceCheckUtils]: 91: Hoare triple {8092#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,149 INFO L290 TraceCheckUtils]: 90: Hoare triple {8092#(<= ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:47,150 INFO L290 TraceCheckUtils]: 89: Hoare triple {8064#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8092#(<= ~counter~0 9)} is VALID [2022-04-28 13:55:47,150 INFO L290 TraceCheckUtils]: 88: Hoare triple {8064#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:47,150 INFO L290 TraceCheckUtils]: 87: Hoare triple {8064#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:47,151 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7811#true} {8064#(<= ~counter~0 8)} #63#return; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:47,151 INFO L290 TraceCheckUtils]: 85: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,151 INFO L290 TraceCheckUtils]: 84: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,151 INFO L290 TraceCheckUtils]: 83: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,151 INFO L272 TraceCheckUtils]: 82: Hoare triple {8064#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,152 INFO L290 TraceCheckUtils]: 81: Hoare triple {8064#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:47,152 INFO L290 TraceCheckUtils]: 80: Hoare triple {8036#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8064#(<= ~counter~0 8)} is VALID [2022-04-28 13:55:47,152 INFO L290 TraceCheckUtils]: 79: Hoare triple {8036#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:47,152 INFO L290 TraceCheckUtils]: 78: Hoare triple {8036#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:47,153 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7811#true} {8036#(<= ~counter~0 7)} #63#return; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:47,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,153 INFO L272 TraceCheckUtils]: 73: Hoare triple {8036#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,153 INFO L290 TraceCheckUtils]: 72: Hoare triple {8036#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:47,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {8008#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8036#(<= ~counter~0 7)} is VALID [2022-04-28 13:55:47,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {8008#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:47,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {8008#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:47,155 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7811#true} {8008#(<= ~counter~0 6)} #63#return; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:47,155 INFO L290 TraceCheckUtils]: 67: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,155 INFO L290 TraceCheckUtils]: 66: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,155 INFO L290 TraceCheckUtils]: 65: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,155 INFO L272 TraceCheckUtils]: 64: Hoare triple {8008#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {8008#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:47,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {7980#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8008#(<= ~counter~0 6)} is VALID [2022-04-28 13:55:47,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {7980#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:47,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {7980#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:47,156 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7811#true} {7980#(<= ~counter~0 5)} #63#return; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:47,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,157 INFO L272 TraceCheckUtils]: 55: Hoare triple {7980#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {7980#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:47,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {7952#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7980#(<= ~counter~0 5)} is VALID [2022-04-28 13:55:47,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {7952#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:47,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {7952#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:47,158 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7811#true} {7952#(<= ~counter~0 4)} #63#return; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:47,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,158 INFO L272 TraceCheckUtils]: 46: Hoare triple {7952#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {7952#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:47,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {7924#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7952#(<= ~counter~0 4)} is VALID [2022-04-28 13:55:47,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {7924#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:47,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {7924#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:47,160 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7811#true} {7924#(<= ~counter~0 3)} #63#return; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:47,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,160 INFO L272 TraceCheckUtils]: 37: Hoare triple {7924#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {7924#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:47,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {7896#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7924#(<= ~counter~0 3)} is VALID [2022-04-28 13:55:47,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {7896#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:47,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {7896#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:47,164 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7811#true} {7896#(<= ~counter~0 2)} #63#return; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:47,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,165 INFO L272 TraceCheckUtils]: 28: Hoare triple {7896#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {7896#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:47,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7896#(<= ~counter~0 2)} is VALID [2022-04-28 13:55:47,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {7868#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:47,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {7868#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:47,173 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7811#true} {7868#(<= ~counter~0 1)} #63#return; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:47,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,173 INFO L272 TraceCheckUtils]: 19: Hoare triple {7868#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {7868#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:47,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {7819#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7868#(<= ~counter~0 1)} is VALID [2022-04-28 13:55:47,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {7819#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:47,175 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7811#true} {7819#(<= ~counter~0 0)} #61#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:47,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,175 INFO L272 TraceCheckUtils]: 11: Hoare triple {7819#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7811#true} {7819#(<= ~counter~0 0)} #59#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:47,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {7811#true} assume true; {7811#true} is VALID [2022-04-28 13:55:47,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {7811#true} assume !(0 == ~cond); {7811#true} is VALID [2022-04-28 13:55:47,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {7811#true} ~cond := #in~cond; {7811#true} is VALID [2022-04-28 13:55:47,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {7819#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {7811#true} is VALID [2022-04-28 13:55:47,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {7819#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:47,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {7819#(<= ~counter~0 0)} call #t~ret7 := main(); {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:47,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7819#(<= ~counter~0 0)} {7811#true} #67#return; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:47,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {7819#(<= ~counter~0 0)} assume true; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:47,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {7811#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7819#(<= ~counter~0 0)} is VALID [2022-04-28 13:55:47,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {7811#true} call ULTIMATE.init(); {7811#true} is VALID [2022-04-28 13:55:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 198 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 13:55:47,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:55:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826783372] [2022-04-28 13:55:47,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:55:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66254031] [2022-04-28 13:55:47,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66254031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:55:47,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:55:47,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 13:55:47,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:55:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795122275] [2022-04-28 13:55:47,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795122275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:55:47,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:55:47,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 13:55:47,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154604853] [2022-04-28 13:55:47,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:55:47,179 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 104 [2022-04-28 13:55:47,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:55:47,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:55:47,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:47,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 13:55:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:47,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 13:55:47,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 13:55:47,239 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:55:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:47,538 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2022-04-28 13:55:47,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 13:55:47,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 104 [2022-04-28 13:55:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:55:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:55:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-28 13:55:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:55:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-28 13:55:47,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 125 transitions. [2022-04-28 13:55:47,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:47,648 INFO L225 Difference]: With dead ends: 115 [2022-04-28 13:55:47,648 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 13:55:47,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2022-04-28 13:55:47,649 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:55:47,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 148 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:55:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 13:55:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-28 13:55:47,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:55:47,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:55:47,749 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:55:47,749 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:55:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:47,751 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 13:55:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 13:55:47,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:47,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:47,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 13:55:47,752 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 13:55:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:55:47,753 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 13:55:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 13:55:47,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:55:47,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:55:47,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:55:47,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:55:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:55:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-28 13:55:47,755 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 104 [2022-04-28 13:55:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:55:47,755 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-28 13:55:47,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:55:47,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 121 transitions. [2022-04-28 13:55:47,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:55:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 13:55:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 13:55:47,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:55:47,861 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:55:47,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 13:55:48,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 13:55:48,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:55:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:55:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 19 times [2022-04-28 13:55:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:55:48,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774593244] [2022-04-28 13:55:48,064 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:55:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 20 times [2022-04-28 13:55:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:55:48,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177154243] [2022-04-28 13:55:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:55:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:55:48,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:55:48,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439887940] [2022-04-28 13:55:48,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:55:48,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:55:48,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:55:48,076 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:55:48,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 13:55:48,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:55:48,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 13:55:48,138 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 13:55:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 13:55:48,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 13:55:48,200 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 13:55:48,201 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 13:55:48,203 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 13:55:48,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 13:55:48,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 13:55:48,424 INFO L356 BasicCegarLoop]: Path program histogram: [20, 2, 2, 2, 2] [2022-04-28 13:55:48,426 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 13:55:48,438 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 13:55:48,439 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 13:55:48,440 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 13:55:48,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:55:48 BoogieIcfgContainer [2022-04-28 13:55:48,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 13:55:48,441 INFO L158 Benchmark]: Toolchain (without parser) took 24121.52ms. Allocated memory was 187.7MB in the beginning and 243.3MB in the end (delta: 55.6MB). Free memory was 141.1MB in the beginning and 160.8MB in the end (delta: -19.6MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2022-04-28 13:55:48,441 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory was 157.4MB in the beginning and 157.3MB in the end (delta: 70.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 13:55:48,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.37ms. Allocated memory is still 187.7MB. Free memory was 141.0MB in the beginning and 165.5MB in the end (delta: -24.5MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-04-28 13:55:48,442 INFO L158 Benchmark]: Boogie Preprocessor took 35.16ms. Allocated memory is still 187.7MB. Free memory was 165.5MB in the beginning and 163.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 13:55:48,442 INFO L158 Benchmark]: RCFGBuilder took 226.69ms. Allocated memory is still 187.7MB. Free memory was 163.8MB in the beginning and 153.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 13:55:48,442 INFO L158 Benchmark]: TraceAbstraction took 23622.50ms. Allocated memory was 187.7MB in the beginning and 243.3MB in the end (delta: 55.6MB). Free memory was 152.6MB in the beginning and 160.8MB in the end (delta: -8.2MB). Peak memory consumption was 46.7MB. Max. memory is 8.0GB. [2022-04-28 13:55:48,442 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.11ms. Allocated memory is still 187.7MB. Free memory was 157.4MB in the beginning and 157.3MB in the end (delta: 70.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.37ms. Allocated memory is still 187.7MB. Free memory was 141.0MB in the beginning and 165.5MB in the end (delta: -24.5MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.16ms. Allocated memory is still 187.7MB. Free memory was 165.5MB in the beginning and 163.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.69ms. Allocated memory is still 187.7MB. Free memory was 163.8MB in the beginning and 153.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23622.50ms. Allocated memory was 187.7MB in the beginning and 243.3MB in the end (delta: 55.6MB). Free memory was 152.6MB in the beginning and 160.8MB in the end (delta: -8.2MB). Peak memory consumption was 46.7MB. 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) [L13] COND FALSE !(!cond) [L29] RET assume_abort_if_not(x1 >= 0) [L30] CALL assume_abort_if_not(x2 != 0) [L13] COND FALSE !(!cond) [L30] RET assume_abort_if_not(x2 != 0) [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND FALSE !(counter++<10) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 1308 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 927 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 381 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1375 GetRequests, 1211 SyntacticMatches, 6 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=13, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 13:55:48,464 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...