/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/cohencu-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:14:02,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:14:02,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:14:02,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:14:02,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:14:02,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:14:02,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:14:02,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:14:02,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:14:02,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:14:02,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:14:02,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:14:02,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:14:02,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:14:02,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:14:02,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:14:02,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:14:02,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:14:02,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:14:02,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:14:02,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:14:02,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:14:02,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:14:02,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:14:02,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:14:02,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:14:02,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:14:02,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:14:02,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:14:02,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:14:02,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:14:02,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:14:02,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:14:02,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:14:02,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:14:02,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:14:02,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:14:02,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:14:02,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:14:02,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:14:02,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:14:02,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:14:02,797 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 11:14:02,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:14:02,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:14:02,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:14:02,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:14:02,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:14:02,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:14:02,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:14:02,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:14:02,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:14:02,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:14:02,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:14:02,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:14:02,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:14:02,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:14:02,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:14:02,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:14:02,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:14:02,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:14:02,813 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:14:02,813 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:14:02,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:14:02,813 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:14:02,813 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 11:14:02,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:14:03,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:14:03,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:14:03,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:14:03,010 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:14:03,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-28 11:14:03,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df79025e0/16f1509bc4e24392a02aa8c00c60bc10/FLAGc5be69343 [2022-04-28 11:14:03,472 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:14:03,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-28 11:14:03,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df79025e0/16f1509bc4e24392a02aa8c00c60bc10/FLAGc5be69343 [2022-04-28 11:14:03,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df79025e0/16f1509bc4e24392a02aa8c00c60bc10 [2022-04-28 11:14:03,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:14:03,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:14:03,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:14:03,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:14:03,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:14:03,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ecb866b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03, skipping insertion in model container [2022-04-28 11:14:03,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:14:03,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:14:03,713 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/cohencu-ll_unwindbound50.c[588,601] [2022-04-28 11:14:03,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:14:03,759 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:14:03,773 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/cohencu-ll_unwindbound50.c[588,601] [2022-04-28 11:14:03,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:14:03,810 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:14:03,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03 WrapperNode [2022-04-28 11:14:03,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:14:03,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:14:03,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:14:03,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:14:03,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:14:03,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:14:03,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:14:03,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:14:03,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (1/1) ... [2022-04-28 11:14:03,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:14:03,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:03,884 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 11:14:03,899 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 11:14:03,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:14:03,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:14:03,926 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:14:03,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:14:03,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:14:03,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:14:03,927 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:14:03,927 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:14:03,927 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:14:03,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:14:03,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:14:03,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:14:03,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:14:03,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:14:03,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:14:03,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:14:03,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:14:03,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:14:03,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:14:03,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:14:03,989 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:14:03,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:14:04,153 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:14:04,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:14:04,174 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:14:04,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:14:04 BoogieIcfgContainer [2022-04-28 11:14:04,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:14:04,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:14:04,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:14:04,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:14:04,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:14:03" (1/3) ... [2022-04-28 11:14:04,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@839d4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:14:04, skipping insertion in model container [2022-04-28 11:14:04,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:03" (2/3) ... [2022-04-28 11:14:04,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@839d4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:14:04, skipping insertion in model container [2022-04-28 11:14:04,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:14:04" (3/3) ... [2022-04-28 11:14:04,192 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-04-28 11:14:04,203 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:14:04,204 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:14:04,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:14:04,263 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@265be4db, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36b38b31 [2022-04-28 11:14:04,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:14:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:14:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 11:14:04,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:04,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:04,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-28 11:14:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:04,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682684167] [2022-04-28 11:14:04,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-28 11:14:04,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:04,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599110402] [2022-04-28 11:14:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:04,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:14:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:04,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 11:14:04,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:14:04,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:14:04,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:14:04,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 11:14:04,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:14:04,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:14:04,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-28 11:14:04,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-28 11:14:04,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 11:14:04,510 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-28 11:14:04,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 11:14:04,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 11:14:04,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 11:14:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:14:04,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:04,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599110402] [2022-04-28 11:14:04,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599110402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:04,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:04,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:14:04,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:04,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682684167] [2022-04-28 11:14:04,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682684167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:04,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:04,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:14:04,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997738881] [2022-04-28 11:14:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 11:14:04,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:04,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:04,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:04,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:14:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:04,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:14:04,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:14:04,572 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:04,791 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-28 11:14:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:14:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 11:14:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:14:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:14:04,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 11:14:04,937 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 11:14:04,948 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:14:04,948 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 11:14:04,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:14:04,955 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:04,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 11:14:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 11:14:04,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:04,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:04,985 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:04,985 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:04,990 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:14:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:14:04,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:04,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:04,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-28 11:14:04,992 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-28 11:14:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:04,996 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:14:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:14:04,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:04,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:04,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:04,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-28 11:14:05,002 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-28 11:14:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:05,002 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-28 11:14:05,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:05,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-28 11:14:05,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-28 11:14:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:14:05,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:05,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:05,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:14:05,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:05,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-28 11:14:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:05,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1153900602] [2022-04-28 11:14:05,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-28 11:14:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:05,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171865219] [2022-04-28 11:14:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:14:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:05,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:14:05,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:14:05,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:14:05,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:14:05,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:14:05,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:14:05,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:14:05,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-28 11:14:05,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:14:05,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-28 11:14:05,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {263#false} is VALID [2022-04-28 11:14:05,134 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-28 11:14:05,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 11:14:05,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 11:14:05,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 11:14:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:14:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:05,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171865219] [2022-04-28 11:14:05,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171865219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:05,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:05,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:14:05,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:05,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1153900602] [2022-04-28 11:14:05,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1153900602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:05,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:05,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:14:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95082262] [2022-04-28 11:14:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:05,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:14:05,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:05,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:05,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:05,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:05,149 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:05,460 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-28 11:14:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:05,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:14:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:14:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:14:05,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-28 11:14:05,533 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 11:14:05,534 INFO L225 Difference]: With dead ends: 40 [2022-04-28 11:14:05,534 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 11:14:05,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 11:14:05,536 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:05,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 11:14:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 11:14:05,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:05,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:05,542 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:05,543 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:05,549 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:14:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:14:05,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:05,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:05,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-28 11:14:05,551 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-28 11:14:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:05,553 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:14:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:14:05,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:05,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:05,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:05,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 11:14:05,557 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-28 11:14:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:05,557 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 11:14:05,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:05,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 11:14:05,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:14:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:14:05,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:05,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:05,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:14:05,615 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-28 11:14:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:05,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393298922] [2022-04-28 11:14:05,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-28 11:14:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:05,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114877240] [2022-04-28 11:14:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:05,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:05,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:14:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:05,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-28 11:14:05,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:14:05,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:14:05,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:14:05,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-28 11:14:05,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:14:05,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:14:05,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-28 11:14:05,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:14:05,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:14:05,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 50);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:14:05,802 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:05,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:05,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-28 11:14:05,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-28 11:14:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:14:05,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:05,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114877240] [2022-04-28 11:14:05,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114877240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:05,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:05,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:05,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:05,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393298922] [2022-04-28 11:14:05,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393298922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:05,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:05,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:05,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125671019] [2022-04-28 11:14:05,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:14:05,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:05,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:05,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:05,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:05,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:05,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:05,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:14:05,822 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:06,231 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 11:14:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:14:06,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:14:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:14:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:14:06,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 11:14:06,291 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 11:14:06,293 INFO L225 Difference]: With dead ends: 34 [2022-04-28 11:14:06,293 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 11:14:06,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:06,297 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:06,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 11:14:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 11:14:06,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:06,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:06,310 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:06,311 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:06,313 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:14:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:14:06,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:06,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:06,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 11:14:06,315 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 11:14:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:06,317 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:14:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:14:06,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:06,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:06,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:06,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:14:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 11:14:06,321 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 11:14:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:06,321 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 11:14:06,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:14:06,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 11:14:06,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:14:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:14:06,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:06,364 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:06,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 11:14:06,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-28 11:14:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:06,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610287446] [2022-04-28 11:14:06,365 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-28 11:14:06,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:06,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087925418] [2022-04-28 11:14:06,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:06,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:06,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:06,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704096027] [2022-04-28 11:14:06,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:06,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:06,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:06,383 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 11:14:06,419 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 11:14:06,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:06,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:06,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:14:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:06,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:06,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-28 11:14:06,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {681#true} is VALID [2022-04-28 11:14:06,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:14:06,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-28 11:14:06,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-28 11:14:06,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:06,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:06,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:06,584 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-28 11:14:06,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-28 11:14:06,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-28 11:14:06,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:14:06,585 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:06,586 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:06,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:06,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-28 11:14:06,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-28 11:14:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:14:06,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:06,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087925418] [2022-04-28 11:14:06,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:06,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704096027] [2022-04-28 11:14:06,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704096027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:06,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:06,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:06,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610287446] [2022-04-28 11:14:06,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610287446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:06,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:06,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:06,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115605953] [2022-04-28 11:14:06,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:06,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 11:14:06,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:06,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:14:06,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:06,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:06,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:06,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:06,608 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:14:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:07,060 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-28 11:14:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:07,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 11:14:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:14:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:14:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:14:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:14:07,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:14:07,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:07,141 INFO L225 Difference]: With dead ends: 50 [2022-04-28 11:14:07,141 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 11:14:07,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 11:14:07,142 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:07,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 11:14:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-28 11:14:07,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:07,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:14:07,157 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:14:07,157 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:14:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:07,161 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:14:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:14:07,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:07,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:07,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 11:14:07,163 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 11:14:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:07,166 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:14:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:14:07,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:07,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:07,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:07,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:14:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-28 11:14:07,169 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-28 11:14:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:07,170 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-28 11:14:07,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:14:07,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-28 11:14:07,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-28 11:14:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:14:07,231 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:07,231 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:07,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:07,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:07,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:07,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-28 11:14:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265677383] [2022-04-28 11:14:07,449 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-28 11:14:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:07,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856375701] [2022-04-28 11:14:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:07,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:07,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001252551] [2022-04-28 11:14:07,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:07,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:07,460 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 11:14:07,481 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 11:14:07,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:07,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:07,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:14:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:07,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:07,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-28 11:14:07,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1010#true} is VALID [2022-04-28 11:14:07,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:14:07,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-28 11:14:07,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-28 11:14:07,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:07,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:07,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:07,620 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-28 11:14:07,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:14:07,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:14:07,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:14:07,621 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:07,621 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1010#true} is VALID [2022-04-28 11:14:07,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:14:07,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:14:07,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:14:07,622 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:07,623 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:07,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:07,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 11:14:07,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 11:14:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:14:07,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:07,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856375701] [2022-04-28 11:14:07,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:07,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001252551] [2022-04-28 11:14:07,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001252551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:07,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:07,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:07,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:07,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265677383] [2022-04-28 11:14:07,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265677383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:07,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:07,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:07,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977679467] [2022-04-28 11:14:07,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:07,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:14:07,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:07,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:07,642 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 11:14:07,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:07,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:07,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:07,643 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:07,938 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:14:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:07,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:14:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:14:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:14:07,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:14:08,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:08,013 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:14:08,013 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:14:08,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 11:14:08,014 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:08,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:14:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-28 11:14:08,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:08,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:08,041 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:08,043 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:08,049 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:14:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:14:08,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:08,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:08,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-28 11:14:08,051 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-28 11:14:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:08,055 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:14:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:14:08,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:08,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:08,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:08,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-28 11:14:08,060 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-28 11:14:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:08,060 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-28 11:14:08,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:08,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-28 11:14:08,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-28 11:14:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:14:08,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:08,146 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:08,173 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 11:14:08,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:08,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-28 11:14:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:08,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248485874] [2022-04-28 11:14:08,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-28 11:14:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:08,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477436251] [2022-04-28 11:14:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:08,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:08,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777219790] [2022-04-28 11:14:08,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:08,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:08,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:08,390 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 11:14:08,391 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 11:14:08,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:08,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:08,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:14:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:08,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:08,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-28 11:14:08,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#true} is VALID [2022-04-28 11:14:08,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:14:08,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-28 11:14:08,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-28 11:14:08,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:08,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:08,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:08,601 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-28 11:14:08,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:14:08,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:14:08,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:14:08,603 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:08,603 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1390#true} is VALID [2022-04-28 11:14:08,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:14:08,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:14:08,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:14:08,604 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:08,604 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-28 11:14:08,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:14:08,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:14:08,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:14:08,607 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:08,608 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:08,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:08,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-28 11:14:08,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-28 11:14:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:14:08,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:08,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:08,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477436251] [2022-04-28 11:14:08,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:08,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777219790] [2022-04-28 11:14:08,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777219790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:08,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:08,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:08,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:08,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248485874] [2022-04-28 11:14:08,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248485874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:08,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:08,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218230728] [2022-04-28 11:14:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:08,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:14:08,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:08,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:08,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:08,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:08,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:08,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:08,631 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:08,994 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-28 11:14:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:08,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:14:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:14:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:14:08,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:14:09,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:09,066 INFO L225 Difference]: With dead ends: 62 [2022-04-28 11:14:09,066 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 11:14:09,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 11:14:09,067 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:09,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 11:14:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 11:14:09,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:09,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:09,086 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:09,086 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:09,088 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:14:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:14:09,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:09,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:09,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-28 11:14:09,089 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-28 11:14:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:09,091 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:14:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:14:09,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:09,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:09,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:09,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 11:14:09,094 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-28 11:14:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:09,094 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 11:14:09,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:09,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 11:14:09,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:14:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:14:09,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:09,159 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 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 11:14:09,178 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 11:14:09,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:09,363 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-28 11:14:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:09,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595272068] [2022-04-28 11:14:09,767 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:09,768 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-28 11:14:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:09,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777956351] [2022-04-28 11:14:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:09,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:09,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:09,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238693896] [2022-04-28 11:14:09,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:09,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:09,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:09,780 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 11:14:09,781 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 11:14:09,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:09,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:09,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:14:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:09,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:10,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:14:10,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:10,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:10,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:10,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:10,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:10,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,059 INFO L272 TraceCheckUtils]: 8: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,070 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,070 INFO L272 TraceCheckUtils]: 13: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,072 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,073 INFO L272 TraceCheckUtils]: 18: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,074 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,075 INFO L272 TraceCheckUtils]: 23: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,077 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,077 INFO L272 TraceCheckUtils]: 28: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,079 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {1825#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:10,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {1825#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1910#(<= |main_#t~post5| 1)} is VALID [2022-04-28 11:14:10,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:14:10,080 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:14:10,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:14:10,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-28 11:14:10,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-28 11:14:10,081 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:14:10,081 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:14:10,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:14:10,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:14:10,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:14:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 11:14:10,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:10,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:14:10,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:14:10,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:14:10,294 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:14:10,294 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:14:10,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:14:10,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:14:10,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:14:10,294 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:14:10,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:14:10,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {1972#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1968#(< |main_#t~post5| 50)} is VALID [2022-04-28 11:14:10,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {1972#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1972#(< ~counter~0 50)} is VALID [2022-04-28 11:14:10,296 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #67#return; {1972#(< ~counter~0 50)} is VALID [2022-04-28 11:14:10,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:14:10,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:14:10,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:14:10,297 INFO L272 TraceCheckUtils]: 28: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1801#true} is VALID [2022-04-28 11:14:10,297 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #65#return; {1972#(< ~counter~0 50)} is VALID [2022-04-28 11:14:10,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:14:10,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:14:10,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:14:10,298 INFO L272 TraceCheckUtils]: 23: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:14:10,298 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #63#return; {1972#(< ~counter~0 50)} is VALID [2022-04-28 11:14:10,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:14:10,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:14:10,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:14:10,299 INFO L272 TraceCheckUtils]: 18: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:14:10,299 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #61#return; {1972#(< ~counter~0 50)} is VALID [2022-04-28 11:14:10,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:14:10,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:14:10,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:14:10,300 INFO L272 TraceCheckUtils]: 13: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1801#true} is VALID [2022-04-28 11:14:10,303 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #59#return; {1972#(< ~counter~0 50)} is VALID [2022-04-28 11:14:10,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:14:10,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:14:10,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:14:10,303 INFO L272 TraceCheckUtils]: 8: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:14:10,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1972#(< ~counter~0 50)} is VALID [2022-04-28 11:14:10,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {2057#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1972#(< ~counter~0 50)} is VALID [2022-04-28 11:14:10,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#(< ~counter~0 49)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2057#(< ~counter~0 49)} is VALID [2022-04-28 11:14:10,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 49)} call #t~ret6 := main(); {2057#(< ~counter~0 49)} is VALID [2022-04-28 11:14:10,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 49)} {1801#true} #81#return; {2057#(< ~counter~0 49)} is VALID [2022-04-28 11:14:10,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 49)} assume true; {2057#(< ~counter~0 49)} is VALID [2022-04-28 11:14:10,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2057#(< ~counter~0 49)} is VALID [2022-04-28 11:14:10,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:14:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:14:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:10,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777956351] [2022-04-28 11:14:10,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:10,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238693896] [2022-04-28 11:14:10,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238693896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:10,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:10,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 11:14:10,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:10,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [595272068] [2022-04-28 11:14:10,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [595272068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:10,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:10,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774945133] [2022-04-28 11:14:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:10,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:14:10,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:10,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:10,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:10,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:10,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:10,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:10,335 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:10,635 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-28 11:14:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:10,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:14:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:14:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:14:10,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-28 11:14:10,705 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 11:14:10,709 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:14:10,709 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:14:10,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 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 11:14:10,713 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:10,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:14:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 11:14:10,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:10,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:10,762 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:10,762 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:10,767 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:14:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:14:10,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:10,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:10,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:14:10,769 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:14:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:10,772 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:14:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:14:10,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:10,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:10,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:10,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 11:14:10,777 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-28 11:14:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:10,778 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 11:14:10,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:10,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 11:14:10,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:14:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:14:10,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:10,846 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:10,871 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 11:14:11,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:11,069 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-28 11:14:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:11,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456939973] [2022-04-28 11:14:11,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:11,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-28 11:14:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:11,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917717937] [2022-04-28 11:14:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:11,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:11,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:11,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412869535] [2022-04-28 11:14:11,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:11,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:11,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:11,429 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 11:14:11,439 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 11:14:11,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:11,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:11,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:14:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:11,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:11,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:14:11,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2448#true} is VALID [2022-04-28 11:14:11,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:14:11,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:14:11,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:11,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:11,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:11,709 INFO L272 TraceCheckUtils]: 8: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,710 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:11,710 INFO L272 TraceCheckUtils]: 13: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,711 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:11,712 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,713 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:11,713 INFO L272 TraceCheckUtils]: 23: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,714 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:11,714 INFO L272 TraceCheckUtils]: 28: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,715 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:11,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:11,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:11,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:11,717 INFO L272 TraceCheckUtils]: 36: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,718 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:11,718 INFO L272 TraceCheckUtils]: 41: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:11,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:11,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:14:11,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:14:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:14:11,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:11,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:14:11,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:14:11,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:11,941 INFO L272 TraceCheckUtils]: 41: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:11,942 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:11,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,942 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,943 INFO L272 TraceCheckUtils]: 36: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 50);havoc #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:11,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:11,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:11,955 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #67#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:11,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,956 INFO L272 TraceCheckUtils]: 28: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,956 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #65#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:11,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,957 INFO L272 TraceCheckUtils]: 23: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,957 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #63#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:11,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,958 INFO L272 TraceCheckUtils]: 18: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,958 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #61#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:11,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,959 INFO L272 TraceCheckUtils]: 13: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,959 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #59#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:11,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:14:11,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:14:11,960 INFO L272 TraceCheckUtils]: 8: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:14:11,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:11,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:11,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:11,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:14:11,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:14:11,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:14:11,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2448#true} is VALID [2022-04-28 11:14:11,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:14:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:14:11,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:11,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917717937] [2022-04-28 11:14:11,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412869535] [2022-04-28 11:14:11,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412869535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:11,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:11,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:14:11,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456939973] [2022-04-28 11:14:11,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456939973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:11,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:11,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238886223] [2022-04-28 11:14:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:14:11,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:11,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:11,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:11,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:11,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:11,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:11,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:11,994 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:12,433 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-28 11:14:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:14:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:14:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:14:12,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-28 11:14:12,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:12,512 INFO L225 Difference]: With dead ends: 78 [2022-04-28 11:14:12,512 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 11:14:12,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:12,513 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:12,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 11:14:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-28 11:14:12,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:12,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:12,564 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:12,565 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:12,568 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:14:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:14:12,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:12,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:12,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:14:12,577 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:14:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:12,580 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:14:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:14:12,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:12,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:12,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:12,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-28 11:14:12,584 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-28 11:14:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:12,584 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-28 11:14:12,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:14:12,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-28 11:14:12,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 11:14:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:14:12,673 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:12,673 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:12,689 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 11:14:12,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:12,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-28 11:14:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:12,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717418690] [2022-04-28 11:14:13,215 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:13,217 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-28 11:14:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:13,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710674650] [2022-04-28 11:14:13,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:13,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:13,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:13,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971338522] [2022-04-28 11:14:13,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:13,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:13,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:13,249 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 11:14:13,251 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 11:14:13,307 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:13,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:13,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:14:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:13,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:13,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:14:13,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#true} is VALID [2022-04-28 11:14:13,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:13,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:14:13,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:14:13,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3167#true} is VALID [2022-04-28 11:14:13,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-28 11:14:13,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 50);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:14:13,597 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:13,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:13,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:13,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:13,598 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:14:13,598 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:13,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:13,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:13,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:13,600 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #61#return; {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:13,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:13,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:13,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:13,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:13,602 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:13,602 INFO L272 TraceCheckUtils]: 23: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:13,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:13,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:13,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:13,603 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3167#true} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:13,603 INFO L272 TraceCheckUtils]: 28: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:13,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:13,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:13,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:13,604 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:13,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:14:13,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:14:13,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 50);havoc #t~post5; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:14:13,615 INFO L272 TraceCheckUtils]: 36: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:13,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:13,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:13,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:13,619 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:13,620 INFO L272 TraceCheckUtils]: 41: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:13,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:13,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:13,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:13,621 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:13,622 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:13,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:13,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:14:13,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:14:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 11:14:13,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:14,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:14:14,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:14:14,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:14,286 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:14,287 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:14,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:14,288 INFO L290 TraceCheckUtils]: 43: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:14,288 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:14,288 INFO L272 TraceCheckUtils]: 41: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:14,289 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:14,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:14,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:14,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:14,290 INFO L272 TraceCheckUtils]: 36: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:14,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:14,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:14,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:14,298 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:14,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:14,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:14,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:14,299 INFO L272 TraceCheckUtils]: 28: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:14,299 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3167#true} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:14,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:14,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:14,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:14,300 INFO L272 TraceCheckUtils]: 23: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:14,300 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #63#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:14,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:14,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:14,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:14,302 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:14,302 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-28 11:14:14,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:14,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 50);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-28 11:14:14,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3167#true} is VALID [2022-04-28 11:14:14,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:14:14,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:14:14,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:14,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#true} is VALID [2022-04-28 11:14:14,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:14:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 11:14:14,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:14,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710674650] [2022-04-28 11:14:14,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:14,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971338522] [2022-04-28 11:14:14,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971338522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:14,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:14,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:14:14,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:14,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717418690] [2022-04-28 11:14:14,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717418690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:14,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:14,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:14:14,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647414566] [2022-04-28 11:14:14,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:14,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:14:14,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:14,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:14,338 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 11:14:14,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:14:14,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:14,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:14:14,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:14:14,339 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:19,130 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-04-28 11:14:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:19,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:14:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:14:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:14:19,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 11:14:20,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:20,474 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:14:20,474 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 11:14:20,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:14:20,475 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:20,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 11:14:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 11:14:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 11:14:20,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:20,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:14:20,537 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:14:20,537 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:14:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:20,540 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-28 11:14:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:14:20,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:20,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:20,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-04-28 11:14:20,541 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-04-28 11:14:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:20,543 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-28 11:14:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:14:20,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:20,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:20,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:20,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:14:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-28 11:14:20,546 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 50 [2022-04-28 11:14:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:20,546 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-28 11:14:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:20,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-28 11:14:22,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:14:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 11:14:22,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:22,652 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:22,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 11:14:22,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:22,853 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-28 11:14:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:22,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1860747082] [2022-04-28 11:14:23,189 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:23,189 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-28 11:14:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:23,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805896189] [2022-04-28 11:14:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:23,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:23,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645738830] [2022-04-28 11:14:23,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:23,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:23,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:23,208 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 11:14:23,235 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 11:14:23,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:23,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:23,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:14:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:23,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:23,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {3898#true} call ULTIMATE.init(); {3898#true} is VALID [2022-04-28 11:14:23,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {3898#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3898#true} is VALID [2022-04-28 11:14:23,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3898#true} {3898#true} #81#return; {3898#true} is VALID [2022-04-28 11:14:23,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {3898#true} call #t~ret6 := main(); {3898#true} is VALID [2022-04-28 11:14:23,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {3898#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:23,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:23,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:23,764 INFO L272 TraceCheckUtils]: 8: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,765 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:23,765 INFO L272 TraceCheckUtils]: 13: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,766 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:23,766 INFO L272 TraceCheckUtils]: 18: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,767 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:23,767 INFO L272 TraceCheckUtils]: 23: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,768 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:23,768 INFO L272 TraceCheckUtils]: 28: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,769 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:23,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:23,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:23,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:23,770 INFO L272 TraceCheckUtils]: 36: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,771 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #59#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:23,771 INFO L272 TraceCheckUtils]: 41: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,772 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #61#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:23,772 INFO L272 TraceCheckUtils]: 46: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,773 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #63#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:23,773 INFO L272 TraceCheckUtils]: 51: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,774 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #65#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:23,774 INFO L272 TraceCheckUtils]: 56: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,775 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #67#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:23,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:23,776 INFO L272 TraceCheckUtils]: 62: Hoare triple {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:23,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:23,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:23,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:23,777 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3898#true} {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:23,777 INFO L272 TraceCheckUtils]: 67: Hoare triple {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:23,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {4107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:23,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {4111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3899#false} is VALID [2022-04-28 11:14:23,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {3899#false} assume !false; {3899#false} is VALID [2022-04-28 11:14:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:23,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:24,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805896189] [2022-04-28 11:14:24,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:24,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645738830] [2022-04-28 11:14:24,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645738830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:24,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:24,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:24,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:24,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1860747082] [2022-04-28 11:14:24,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1860747082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:24,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:24,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328778351] [2022-04-28 11:14:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:14:24,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:24,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:24,237 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 11:14:24,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:24,238 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:24,690 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-04-28 11:14:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:24,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:14:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:14:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:14:24,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-28 11:14:24,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:24,761 INFO L225 Difference]: With dead ends: 84 [2022-04-28 11:14:24,761 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 11:14:24,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:24,762 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:24,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 11:14:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-28 11:14:24,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:24,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:24,843 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:24,843 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:24,849 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-28 11:14:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-28 11:14:24,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:24,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:24,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 82 states. [2022-04-28 11:14:24,850 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 82 states. [2022-04-28 11:14:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:24,853 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-28 11:14:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-28 11:14:24,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:24,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:24,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:24,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-04-28 11:14:24,856 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 71 [2022-04-28 11:14:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:24,856 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-04-28 11:14:24,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:24,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 92 transitions. [2022-04-28 11:14:25,022 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 11:14:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-28 11:14:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 11:14:25,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:25,024 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:25,041 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 11:14:25,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:25,232 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:25,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-28 11:14:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:25,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519081311] [2022-04-28 11:14:25,550 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:25,550 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-28 11:14:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:25,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058894474] [2022-04-28 11:14:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:25,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:25,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952906927] [2022-04-28 11:14:25,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:25,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:25,575 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 11:14:25,608 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 11:14:25,636 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:25,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:25,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:14:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:25,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:25,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2022-04-28 11:14:25,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {4735#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {4743#(<= ~counter~0 0)} assume true; {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4743#(<= ~counter~0 0)} {4735#true} #81#return; {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {4743#(<= ~counter~0 0)} call #t~ret6 := main(); {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {4743#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {4743#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {4759#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,941 INFO L272 TraceCheckUtils]: 8: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,943 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #59#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,944 INFO L272 TraceCheckUtils]: 13: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,945 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #61#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,946 INFO L272 TraceCheckUtils]: 18: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,947 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #63#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,948 INFO L272 TraceCheckUtils]: 23: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,952 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #65#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,953 INFO L272 TraceCheckUtils]: 28: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,954 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #67#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {4759#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {4759#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {4844#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,956 INFO L272 TraceCheckUtils]: 36: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,958 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #59#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,958 INFO L272 TraceCheckUtils]: 41: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,962 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #61#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,962 INFO L272 TraceCheckUtils]: 46: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,964 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #63#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,965 INFO L272 TraceCheckUtils]: 51: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,966 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #65#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,967 INFO L272 TraceCheckUtils]: 56: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,968 INFO L290 TraceCheckUtils]: 59: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,968 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #67#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {4844#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {4844#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4929#(<= |main_#t~post5| 2)} is VALID [2022-04-28 11:14:25,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {4929#(<= |main_#t~post5| 2)} assume !(#t~post5 < 50);havoc #t~post5; {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L272 TraceCheckUtils]: 64: Hoare triple {4736#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L290 TraceCheckUtils]: 65: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L290 TraceCheckUtils]: 66: Hoare triple {4736#false} assume !(0 == ~cond); {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L290 TraceCheckUtils]: 67: Hoare triple {4736#false} assume true; {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4736#false} {4736#false} #69#return; {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L272 TraceCheckUtils]: 69: Hoare triple {4736#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L290 TraceCheckUtils]: 70: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L290 TraceCheckUtils]: 71: Hoare triple {4736#false} assume 0 == ~cond; {4736#false} is VALID [2022-04-28 11:14:25,970 INFO L290 TraceCheckUtils]: 72: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2022-04-28 11:14:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 60 proven. 112 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-28 11:14:25,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:26,292 INFO L290 TraceCheckUtils]: 72: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2022-04-28 11:14:26,292 INFO L290 TraceCheckUtils]: 71: Hoare triple {4736#false} assume 0 == ~cond; {4736#false} is VALID [2022-04-28 11:14:26,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-28 11:14:26,292 INFO L272 TraceCheckUtils]: 69: Hoare triple {4736#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4736#false} is VALID [2022-04-28 11:14:26,292 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4735#true} {4736#false} #69#return; {4736#false} is VALID [2022-04-28 11:14:26,292 INFO L290 TraceCheckUtils]: 67: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,292 INFO L290 TraceCheckUtils]: 66: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,293 INFO L272 TraceCheckUtils]: 64: Hoare triple {4736#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {4987#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {4736#false} is VALID [2022-04-28 11:14:26,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {4991#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4987#(< |main_#t~post5| 50)} is VALID [2022-04-28 11:14:26,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {4991#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4991#(< ~counter~0 50)} is VALID [2022-04-28 11:14:26,294 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #67#return; {4991#(< ~counter~0 50)} is VALID [2022-04-28 11:14:26,294 INFO L290 TraceCheckUtils]: 59: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,295 INFO L272 TraceCheckUtils]: 56: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,295 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #65#return; {4991#(< ~counter~0 50)} is VALID [2022-04-28 11:14:26,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,296 INFO L272 TraceCheckUtils]: 51: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,296 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #63#return; {4991#(< ~counter~0 50)} is VALID [2022-04-28 11:14:26,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,297 INFO L272 TraceCheckUtils]: 46: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,297 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #61#return; {4991#(< ~counter~0 50)} is VALID [2022-04-28 11:14:26,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,297 INFO L272 TraceCheckUtils]: 41: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,298 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #59#return; {4991#(< ~counter~0 50)} is VALID [2022-04-28 11:14:26,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,298 INFO L272 TraceCheckUtils]: 36: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {4991#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {4991#(< ~counter~0 50)} is VALID [2022-04-28 11:14:26,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {5076#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4991#(< ~counter~0 50)} is VALID [2022-04-28 11:14:26,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {5076#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5076#(< ~counter~0 49)} is VALID [2022-04-28 11:14:26,300 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #67#return; {5076#(< ~counter~0 49)} is VALID [2022-04-28 11:14:26,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,301 INFO L272 TraceCheckUtils]: 28: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,301 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #65#return; {5076#(< ~counter~0 49)} is VALID [2022-04-28 11:14:26,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,302 INFO L272 TraceCheckUtils]: 23: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,302 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #63#return; {5076#(< ~counter~0 49)} is VALID [2022-04-28 11:14:26,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,303 INFO L272 TraceCheckUtils]: 18: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,303 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #61#return; {5076#(< ~counter~0 49)} is VALID [2022-04-28 11:14:26,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,304 INFO L272 TraceCheckUtils]: 13: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,304 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #59#return; {5076#(< ~counter~0 49)} is VALID [2022-04-28 11:14:26,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:26,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:26,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:26,305 INFO L272 TraceCheckUtils]: 8: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:26,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {5076#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {5076#(< ~counter~0 49)} is VALID [2022-04-28 11:14:26,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {5161#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5076#(< ~counter~0 49)} is VALID [2022-04-28 11:14:26,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#(< ~counter~0 48)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5161#(< ~counter~0 48)} is VALID [2022-04-28 11:14:26,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#(< ~counter~0 48)} call #t~ret6 := main(); {5161#(< ~counter~0 48)} is VALID [2022-04-28 11:14:26,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#(< ~counter~0 48)} {4735#true} #81#return; {5161#(< ~counter~0 48)} is VALID [2022-04-28 11:14:26,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#(< ~counter~0 48)} assume true; {5161#(< ~counter~0 48)} is VALID [2022-04-28 11:14:26,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {4735#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5161#(< ~counter~0 48)} is VALID [2022-04-28 11:14:26,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2022-04-28 11:14:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:26,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058894474] [2022-04-28 11:14:26,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:26,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952906927] [2022-04-28 11:14:26,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952906927] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:26,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:26,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:14:26,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:26,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519081311] [2022-04-28 11:14:26,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519081311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:26,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:26,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:26,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414116320] [2022-04-28 11:14:26,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-28 11:14:26,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:26,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:26,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:26,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:26,353 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:26,818 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-28 11:14:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:14:26,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-28 11:14:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 11:14:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 11:14:26,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 11:14:26,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:26,891 INFO L225 Difference]: With dead ends: 111 [2022-04-28 11:14:26,891 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:14:26,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 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 11:14:26,892 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:26,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:14:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-28 11:14:26,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:26,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:26,974 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:26,974 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:26,976 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:14:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:14:26,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:26,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:26,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 96 states. [2022-04-28 11:14:26,977 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 96 states. [2022-04-28 11:14:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:26,979 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:14:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:14:26,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:26,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:26,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:26,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-04-28 11:14:26,982 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 73 [2022-04-28 11:14:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:26,982 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-04-28 11:14:26,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:26,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 103 transitions. [2022-04-28 11:14:27,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-04-28 11:14:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:14:27,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:27,136 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 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 11:14:27,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 11:14:27,343 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,SelfDestructingSolverStorable10 [2022-04-28 11:14:27,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-28 11:14:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:27,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667035936] [2022-04-28 11:14:27,626 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:27,626 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-28 11:14:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:27,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190864642] [2022-04-28 11:14:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:27,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:27,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079374143] [2022-04-28 11:14:27,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:27,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:27,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:27,638 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 11:14:27,644 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 11:14:27,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:27,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:27,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:14:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:27,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:28,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {5788#true} call ULTIMATE.init(); {5788#true} is VALID [2022-04-28 11:14:28,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {5788#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5788#true} is VALID [2022-04-28 11:14:28,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5788#true} {5788#true} #81#return; {5788#true} is VALID [2022-04-28 11:14:28,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {5788#true} call #t~ret6 := main(); {5788#true} is VALID [2022-04-28 11:14:28,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {5788#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:28,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:28,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:28,335 INFO L272 TraceCheckUtils]: 8: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,336 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:28,336 INFO L272 TraceCheckUtils]: 13: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,337 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:28,337 INFO L272 TraceCheckUtils]: 18: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,338 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:28,338 INFO L272 TraceCheckUtils]: 23: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,339 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:28,339 INFO L272 TraceCheckUtils]: 28: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,340 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:28,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:28,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:28,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:28,342 INFO L272 TraceCheckUtils]: 36: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,343 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:28,343 INFO L272 TraceCheckUtils]: 41: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,344 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:28,344 INFO L272 TraceCheckUtils]: 46: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,348 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:28,348 INFO L272 TraceCheckUtils]: 51: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,349 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:28,349 INFO L272 TraceCheckUtils]: 56: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,350 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:28,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:28,351 INFO L272 TraceCheckUtils]: 62: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,352 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5788#true} {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:28,352 INFO L272 TraceCheckUtils]: 67: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:28,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:28,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:28,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:28,353 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5788#true} {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:28,354 INFO L272 TraceCheckUtils]: 72: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:28,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {6012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:28,355 INFO L290 TraceCheckUtils]: 74: Hoare triple {6016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5789#false} is VALID [2022-04-28 11:14:28,355 INFO L290 TraceCheckUtils]: 75: Hoare triple {5789#false} assume !false; {5789#false} is VALID [2022-04-28 11:14:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:14:28,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190864642] [2022-04-28 11:14:36,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079374143] [2022-04-28 11:14:36,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079374143] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:36,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:36,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:36,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667035936] [2022-04-28 11:14:36,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667035936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:36,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:36,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:36,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104610764] [2022-04-28 11:14:36,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:36,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:36,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:36,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:36,770 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 11:14:36,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:36,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:36,771 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:37,230 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:14:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:37,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:14:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:14:37,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-28 11:14:37,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:37,306 INFO L225 Difference]: With dead ends: 96 [2022-04-28 11:14:37,306 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 11:14:37,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:37,307 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:37,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 11:14:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 11:14:37,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:37,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:37,410 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:37,410 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:37,412 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-28 11:14:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:14:37,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:37,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:37,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 85 states. [2022-04-28 11:14:37,413 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 85 states. [2022-04-28 11:14:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:37,415 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-28 11:14:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:14:37,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:37,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:37,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:37,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-04-28 11:14:37,418 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 76 [2022-04-28 11:14:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:37,418 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-04-28 11:14:37,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:37,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 92 transitions. [2022-04-28 11:14:37,547 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 11:14:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:14:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 11:14:37,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:37,548 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:37,565 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 11:14:37,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:37,751 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-28 11:14:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:37,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120443689] [2022-04-28 11:14:38,032 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:38,032 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-28 11:14:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:38,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656133182] [2022-04-28 11:14:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:38,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:38,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751876318] [2022-04-28 11:14:38,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:38,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:38,063 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 11:14:38,064 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 11:14:38,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:38,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:38,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:14:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:38,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:38,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {6693#true} call ULTIMATE.init(); {6693#true} is VALID [2022-04-28 11:14:38,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {6693#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6693#true} is VALID [2022-04-28 11:14:38,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6693#true} {6693#true} #81#return; {6693#true} is VALID [2022-04-28 11:14:38,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {6693#true} call #t~ret6 := main(); {6693#true} is VALID [2022-04-28 11:14:38,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {6693#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:38,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:38,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:38,872 INFO L272 TraceCheckUtils]: 8: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,873 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:38,873 INFO L272 TraceCheckUtils]: 13: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,874 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:38,874 INFO L272 TraceCheckUtils]: 18: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,874 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:38,874 INFO L272 TraceCheckUtils]: 23: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,875 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:38,875 INFO L272 TraceCheckUtils]: 28: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,876 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:38,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:38,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:38,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:38,880 INFO L272 TraceCheckUtils]: 36: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,882 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #59#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:38,883 INFO L272 TraceCheckUtils]: 41: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,883 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #61#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:38,883 INFO L272 TraceCheckUtils]: 46: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,884 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #63#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:38,884 INFO L272 TraceCheckUtils]: 51: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,884 INFO L290 TraceCheckUtils]: 52: Hoare triple {6693#true} ~cond := #in~cond; {6856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:38,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {6856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:38,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:38,885 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #65#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:38,885 INFO L272 TraceCheckUtils]: 56: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,887 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #67#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:38,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:38,888 INFO L290 TraceCheckUtils]: 62: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:38,888 INFO L290 TraceCheckUtils]: 63: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:38,888 INFO L272 TraceCheckUtils]: 64: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,888 INFO L290 TraceCheckUtils]: 66: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,888 INFO L290 TraceCheckUtils]: 67: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,889 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #59#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:38,889 INFO L272 TraceCheckUtils]: 69: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,889 INFO L290 TraceCheckUtils]: 70: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,889 INFO L290 TraceCheckUtils]: 71: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,889 INFO L290 TraceCheckUtils]: 72: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,890 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #61#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:38,890 INFO L272 TraceCheckUtils]: 74: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,890 INFO L290 TraceCheckUtils]: 75: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,890 INFO L290 TraceCheckUtils]: 76: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,890 INFO L290 TraceCheckUtils]: 77: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,890 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #63#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:38,890 INFO L272 TraceCheckUtils]: 79: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,891 INFO L290 TraceCheckUtils]: 80: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,891 INFO L290 TraceCheckUtils]: 81: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,891 INFO L290 TraceCheckUtils]: 82: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,891 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #65#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:38,891 INFO L272 TraceCheckUtils]: 84: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,891 INFO L290 TraceCheckUtils]: 85: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,891 INFO L290 TraceCheckUtils]: 86: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,891 INFO L290 TraceCheckUtils]: 87: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,892 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #67#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:38,892 INFO L290 TraceCheckUtils]: 89: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !(~n~0 <= ~a~0); {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-28 11:14:38,892 INFO L272 TraceCheckUtils]: 90: Hoare triple {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:38,893 INFO L290 TraceCheckUtils]: 91: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:38,893 INFO L290 TraceCheckUtils]: 92: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:38,893 INFO L290 TraceCheckUtils]: 93: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:38,893 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6693#true} {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} #69#return; {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-28 11:14:38,894 INFO L272 TraceCheckUtils]: 95: Hoare triple {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6989#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:38,894 INFO L290 TraceCheckUtils]: 96: Hoare triple {6989#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6993#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:38,894 INFO L290 TraceCheckUtils]: 97: Hoare triple {6993#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6694#false} is VALID [2022-04-28 11:14:38,894 INFO L290 TraceCheckUtils]: 98: Hoare triple {6694#false} assume !false; {6694#false} is VALID [2022-04-28 11:14:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 55 proven. 46 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-28 11:14:38,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:39,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:39,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656133182] [2022-04-28 11:14:39,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:39,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751876318] [2022-04-28 11:14:39,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751876318] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:39,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:39,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 11:14:39,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:39,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120443689] [2022-04-28 11:14:39,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120443689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:39,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:39,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:14:39,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844277797] [2022-04-28 11:14:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:39,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-28 11:14:39,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:39,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:39,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:39,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:14:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:14:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:14:39,364 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:40,645 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-28 11:14:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:14:40,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-28 11:14:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 11:14:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 11:14:40,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-28 11:14:40,738 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 11:14:40,739 INFO L225 Difference]: With dead ends: 100 [2022-04-28 11:14:40,739 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 11:14:40,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:14:40,740 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:40,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:14:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 11:14:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-28 11:14:40,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:40,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:40,829 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:40,829 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:40,831 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-28 11:14:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-28 11:14:40,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:40,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:40,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 98 states. [2022-04-28 11:14:40,832 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 98 states. [2022-04-28 11:14:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:40,835 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-28 11:14:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-28 11:14:40,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:40,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:40,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:40,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-04-28 11:14:40,838 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 99 [2022-04-28 11:14:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:40,838 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-04-28 11:14:40,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:40,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 111 transitions. [2022-04-28 11:14:40,995 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 11:14:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-28 11:14:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 11:14:40,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:40,996 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:41,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 11:14:41,197 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,SelfDestructingSolverStorable12 [2022-04-28 11:14:41,197 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-28 11:14:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:41,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1212077883] [2022-04-28 11:14:41,434 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:41,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-28 11:14:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:41,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790680446] [2022-04-28 11:14:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:41,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:41,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345947564] [2022-04-28 11:14:41,444 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:14:41,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:41,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:41,447 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 11:14:41,452 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 11:14:41,682 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:14:41,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:41,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:14:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:41,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:42,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2022-04-28 11:14:42,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:42,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#(<= ~counter~0 0)} assume true; {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:42,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#(<= ~counter~0 0)} {7715#true} #81#return; {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:42,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {7723#(<= ~counter~0 0)} call #t~ret6 := main(); {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:42,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:42,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {7723#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {7739#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,056 INFO L272 TraceCheckUtils]: 8: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,057 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #59#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,058 INFO L272 TraceCheckUtils]: 13: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,059 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #61#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,059 INFO L272 TraceCheckUtils]: 18: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,060 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #63#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,061 INFO L272 TraceCheckUtils]: 23: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,062 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #65#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,063 INFO L272 TraceCheckUtils]: 28: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,064 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #67#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {7739#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:42,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {7739#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {7824#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,065 INFO L272 TraceCheckUtils]: 36: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,067 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #59#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,068 INFO L272 TraceCheckUtils]: 41: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,069 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #61#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,069 INFO L272 TraceCheckUtils]: 46: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,075 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #63#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,076 INFO L272 TraceCheckUtils]: 51: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,077 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #65#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,078 INFO L272 TraceCheckUtils]: 56: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,079 INFO L290 TraceCheckUtils]: 58: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,079 INFO L290 TraceCheckUtils]: 59: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,080 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #67#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {7824#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:42,081 INFO L290 TraceCheckUtils]: 62: Hoare triple {7824#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,081 INFO L290 TraceCheckUtils]: 63: Hoare triple {7909#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,081 INFO L272 TraceCheckUtils]: 64: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,082 INFO L290 TraceCheckUtils]: 65: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,083 INFO L290 TraceCheckUtils]: 67: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,083 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #59#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,084 INFO L272 TraceCheckUtils]: 69: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,084 INFO L290 TraceCheckUtils]: 71: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,085 INFO L290 TraceCheckUtils]: 72: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,085 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #61#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,086 INFO L272 TraceCheckUtils]: 74: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,086 INFO L290 TraceCheckUtils]: 75: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,087 INFO L290 TraceCheckUtils]: 76: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,087 INFO L290 TraceCheckUtils]: 77: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,087 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #63#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,088 INFO L272 TraceCheckUtils]: 79: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,088 INFO L290 TraceCheckUtils]: 80: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,089 INFO L290 TraceCheckUtils]: 81: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,089 INFO L290 TraceCheckUtils]: 82: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,090 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #65#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,090 INFO L272 TraceCheckUtils]: 84: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,091 INFO L290 TraceCheckUtils]: 87: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,092 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #67#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {7909#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:42,092 INFO L290 TraceCheckUtils]: 90: Hoare triple {7909#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7994#(<= |main_#t~post5| 3)} is VALID [2022-04-28 11:14:42,093 INFO L290 TraceCheckUtils]: 91: Hoare triple {7994#(<= |main_#t~post5| 3)} assume !(#t~post5 < 50);havoc #t~post5; {7716#false} is VALID [2022-04-28 11:14:42,093 INFO L272 TraceCheckUtils]: 92: Hoare triple {7716#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7716#false} is VALID [2022-04-28 11:14:42,093 INFO L290 TraceCheckUtils]: 93: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-28 11:14:42,093 INFO L290 TraceCheckUtils]: 94: Hoare triple {7716#false} assume !(0 == ~cond); {7716#false} is VALID [2022-04-28 11:14:42,093 INFO L290 TraceCheckUtils]: 95: Hoare triple {7716#false} assume true; {7716#false} is VALID [2022-04-28 11:14:42,093 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7716#false} {7716#false} #69#return; {7716#false} is VALID [2022-04-28 11:14:42,093 INFO L272 TraceCheckUtils]: 97: Hoare triple {7716#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7716#false} is VALID [2022-04-28 11:14:42,094 INFO L290 TraceCheckUtils]: 98: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-28 11:14:42,094 INFO L290 TraceCheckUtils]: 99: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-28 11:14:42,094 INFO L290 TraceCheckUtils]: 100: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-28 11:14:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 90 proven. 330 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-28 11:14:42,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:42,444 INFO L290 TraceCheckUtils]: 100: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-28 11:14:42,444 INFO L290 TraceCheckUtils]: 99: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-28 11:14:42,444 INFO L290 TraceCheckUtils]: 98: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-28 11:14:42,444 INFO L272 TraceCheckUtils]: 97: Hoare triple {7716#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7716#false} is VALID [2022-04-28 11:14:42,444 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7715#true} {7716#false} #69#return; {7716#false} is VALID [2022-04-28 11:14:42,444 INFO L290 TraceCheckUtils]: 95: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,444 INFO L290 TraceCheckUtils]: 94: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,444 INFO L290 TraceCheckUtils]: 93: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,445 INFO L272 TraceCheckUtils]: 92: Hoare triple {7716#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,445 INFO L290 TraceCheckUtils]: 91: Hoare triple {8052#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {7716#false} is VALID [2022-04-28 11:14:42,445 INFO L290 TraceCheckUtils]: 90: Hoare triple {8056#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8052#(< |main_#t~post5| 50)} is VALID [2022-04-28 11:14:42,445 INFO L290 TraceCheckUtils]: 89: Hoare triple {8056#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8056#(< ~counter~0 50)} is VALID [2022-04-28 11:14:42,446 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #67#return; {8056#(< ~counter~0 50)} is VALID [2022-04-28 11:14:42,446 INFO L290 TraceCheckUtils]: 87: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,446 INFO L290 TraceCheckUtils]: 86: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,446 INFO L290 TraceCheckUtils]: 85: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,446 INFO L272 TraceCheckUtils]: 84: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,447 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #65#return; {8056#(< ~counter~0 50)} is VALID [2022-04-28 11:14:42,447 INFO L290 TraceCheckUtils]: 82: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,447 INFO L290 TraceCheckUtils]: 80: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,447 INFO L272 TraceCheckUtils]: 79: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,447 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #63#return; {8056#(< ~counter~0 50)} is VALID [2022-04-28 11:14:42,447 INFO L290 TraceCheckUtils]: 77: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,447 INFO L290 TraceCheckUtils]: 76: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,447 INFO L290 TraceCheckUtils]: 75: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,448 INFO L272 TraceCheckUtils]: 74: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,448 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #61#return; {8056#(< ~counter~0 50)} is VALID [2022-04-28 11:14:42,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,448 INFO L290 TraceCheckUtils]: 71: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,448 INFO L272 TraceCheckUtils]: 69: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,449 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #59#return; {8056#(< ~counter~0 50)} is VALID [2022-04-28 11:14:42,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,449 INFO L272 TraceCheckUtils]: 64: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {8056#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {8056#(< ~counter~0 50)} is VALID [2022-04-28 11:14:42,450 INFO L290 TraceCheckUtils]: 62: Hoare triple {8141#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8056#(< ~counter~0 50)} is VALID [2022-04-28 11:14:42,450 INFO L290 TraceCheckUtils]: 61: Hoare triple {8141#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8141#(< ~counter~0 49)} is VALID [2022-04-28 11:14:42,450 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #67#return; {8141#(< ~counter~0 49)} is VALID [2022-04-28 11:14:42,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,451 INFO L272 TraceCheckUtils]: 56: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,451 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #65#return; {8141#(< ~counter~0 49)} is VALID [2022-04-28 11:14:42,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,451 INFO L272 TraceCheckUtils]: 51: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,452 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #63#return; {8141#(< ~counter~0 49)} is VALID [2022-04-28 11:14:42,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,452 INFO L272 TraceCheckUtils]: 46: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,452 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #61#return; {8141#(< ~counter~0 49)} is VALID [2022-04-28 11:14:42,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,453 INFO L272 TraceCheckUtils]: 41: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,453 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #59#return; {8141#(< ~counter~0 49)} is VALID [2022-04-28 11:14:42,453 INFO L290 TraceCheckUtils]: 39: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,453 INFO L272 TraceCheckUtils]: 36: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {8141#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {8141#(< ~counter~0 49)} is VALID [2022-04-28 11:14:42,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {8226#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8141#(< ~counter~0 49)} is VALID [2022-04-28 11:14:42,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {8226#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8226#(< ~counter~0 48)} is VALID [2022-04-28 11:14:42,455 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #67#return; {8226#(< ~counter~0 48)} is VALID [2022-04-28 11:14:42,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,455 INFO L272 TraceCheckUtils]: 28: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,455 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #65#return; {8226#(< ~counter~0 48)} is VALID [2022-04-28 11:14:42,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,456 INFO L272 TraceCheckUtils]: 23: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,456 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #63#return; {8226#(< ~counter~0 48)} is VALID [2022-04-28 11:14:42,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,456 INFO L272 TraceCheckUtils]: 18: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,457 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #61#return; {8226#(< ~counter~0 48)} is VALID [2022-04-28 11:14:42,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,457 INFO L272 TraceCheckUtils]: 13: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,457 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #59#return; {8226#(< ~counter~0 48)} is VALID [2022-04-28 11:14:42,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:42,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:42,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:42,458 INFO L272 TraceCheckUtils]: 8: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:42,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {8226#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {8226#(< ~counter~0 48)} is VALID [2022-04-28 11:14:42,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {8311#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8226#(< ~counter~0 48)} is VALID [2022-04-28 11:14:42,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {8311#(< ~counter~0 47)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8311#(< ~counter~0 47)} is VALID [2022-04-28 11:14:42,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {8311#(< ~counter~0 47)} call #t~ret6 := main(); {8311#(< ~counter~0 47)} is VALID [2022-04-28 11:14:42,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8311#(< ~counter~0 47)} {7715#true} #81#return; {8311#(< ~counter~0 47)} is VALID [2022-04-28 11:14:42,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {8311#(< ~counter~0 47)} assume true; {8311#(< ~counter~0 47)} is VALID [2022-04-28 11:14:42,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8311#(< ~counter~0 47)} is VALID [2022-04-28 11:14:42,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2022-04-28 11:14:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:14:42,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:42,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790680446] [2022-04-28 11:14:42,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:42,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345947564] [2022-04-28 11:14:42,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345947564] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:42,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:42,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 11:14:42,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:42,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1212077883] [2022-04-28 11:14:42,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1212077883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:42,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:42,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:42,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453765829] [2022-04-28 11:14:42,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-28 11:14:42,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:42,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:42,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:42,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:42,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:42,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:42,509 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:42,950 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-04-28 11:14:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:14:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-28 11:14:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:14:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:14:42,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-28 11:14:43,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:43,044 INFO L225 Difference]: With dead ends: 127 [2022-04-28 11:14:43,044 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 11:14:43,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 191 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 11:14:43,045 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:43,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 130 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 11:14:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-04-28 11:14:43,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:43,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:43,157 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:43,157 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:43,159 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-28 11:14:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-28 11:14:43,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:43,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:43,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 112 states. [2022-04-28 11:14:43,160 INFO L87 Difference]: Start difference. First operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 112 states. [2022-04-28 11:14:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:43,162 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-28 11:14:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-28 11:14:43,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:43,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:43,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:43,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-04-28 11:14:43,166 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 101 [2022-04-28 11:14:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:43,166 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-04-28 11:14:43,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:43,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 122 transitions. [2022-04-28 11:14:43,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-04-28 11:14:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 11:14:43,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:43,344 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:43,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 11:14:43,547 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,SelfDestructingSolverStorable13 [2022-04-28 11:14:43,547 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:43,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 3 times [2022-04-28 11:14:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:43,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910669197] [2022-04-28 11:14:43,789 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:43,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 4 times [2022-04-28 11:14:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:43,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226789106] [2022-04-28 11:14:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:43,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:43,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119002839] [2022-04-28 11:14:43,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:43,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:43,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:43,805 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 11:14:43,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process