/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:11:50,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:11:50,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:11:50,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:11:50,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:11:50,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:11:50,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:11:50,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:11:50,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:11:50,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:11:50,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:11:50,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:11:50,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:11:50,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:11:50,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:11:50,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:11:50,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:11:50,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:11:50,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:11:50,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:11:50,674 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:11:50,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:11:50,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:11:50,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:11:50,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:11:50,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:11:50,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:11:50,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:11:50,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:11:50,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:11:50,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:11:50,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:11:50,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:11:50,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:11:50,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:11:50,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:11:50,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:11:50,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:11:50,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:11:50,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:11:50,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:11:50,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:11:50,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:11:50,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:11:50,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:11:50,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:11:50,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:11:50,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:11:50,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:11:50,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:11:50,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:11:50,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:11:50,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:11:50,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:11:50,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:11:50,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:11:50,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:11:50,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:11:50,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:11:50,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:11:50,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:11:50,710 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:11:50,711 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:11:50,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:11:50,711 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:11:50,711 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 11:11:50,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:11:50,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:11:50,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:11:50,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:11:50,979 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:11:50,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-08 11:11:51,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbda21f95/19555a25809e4d49bf61d18b57977f99/FLAGcf6bd5a0f [2022-04-08 11:11:51,436 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:11:51,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-08 11:11:51,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbda21f95/19555a25809e4d49bf61d18b57977f99/FLAGcf6bd5a0f [2022-04-08 11:11:51,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbda21f95/19555a25809e4d49bf61d18b57977f99 [2022-04-08 11:11:51,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:11:51,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:11:51,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:11:51,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:11:51,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:11:51,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:11:51" (1/1) ... [2022-04-08 11:11:51,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b111bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:51, skipping insertion in model container [2022-04-08 11:11:51,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:11:51" (1/1) ... [2022-04-08 11:11:51,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:11:51,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:11:52,088 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_unwindbound20.c[588,601] [2022-04-08 11:11:52,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:11:52,130 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:11:52,144 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_unwindbound20.c[588,601] [2022-04-08 11:11:52,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:11:52,186 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:11:52,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52 WrapperNode [2022-04-08 11:11:52,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:11:52,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:11:52,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:11:52,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:11:52,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (1/1) ... [2022-04-08 11:11:52,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (1/1) ... [2022-04-08 11:11:52,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (1/1) ... [2022-04-08 11:11:52,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (1/1) ... [2022-04-08 11:11:52,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (1/1) ... [2022-04-08 11:11:52,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (1/1) ... [2022-04-08 11:11:52,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (1/1) ... [2022-04-08 11:11:52,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:11:52,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:11:52,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:11:52,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:11:52,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (1/1) ... [2022-04-08 11:11:52,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:11:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:52,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 11:11:52,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 11:11:52,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:11:52,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:11:52,317 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:11:52,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:11:52,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:11:52,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:11:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:11:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:11:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:11:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:11:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-08 11:11:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:11:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:11:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:11:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:11:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:11:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:11:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:11:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:11:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:11:52,385 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:11:52,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:11:52,591 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:11:52,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:11:52,613 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 11:11:52,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:11:52 BoogieIcfgContainer [2022-04-08 11:11:52,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:11:52,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:11:52,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:11:52,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:11:52,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:11:51" (1/3) ... [2022-04-08 11:11:52,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f058b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:11:52, skipping insertion in model container [2022-04-08 11:11:52,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:11:52" (2/3) ... [2022-04-08 11:11:52,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f058b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:11:52, skipping insertion in model container [2022-04-08 11:11:52,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:11:52" (3/3) ... [2022-04-08 11:11:52,624 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2022-04-08 11:11:52,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:11:52,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:11:52,668 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:11:52,676 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 11:11:52,676 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:11:52,696 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-08 11:11:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 11:11:52,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:52,702 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:52,703 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:52,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:52,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-08 11:11:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:52,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939895509] [2022-04-08 11:11:52,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:11:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-08 11:11:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659164621] [2022-04-08 11:11:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:11:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:52,977 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-08 11:11:52,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 11:11:52,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-08 11:11:52,982 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-08 11:11:52,982 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-08 11:11:52,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 11:11:52,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-08 11:11:52,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-08 11:11:52,983 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-08 11:11:52,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 11:11:52,984 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-08 11:11:52,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 11:11:52,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 11:11:52,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 11:11:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:11:52,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:52,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659164621] [2022-04-08 11:11:52,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659164621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:52,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:52,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:11:52,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:52,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939895509] [2022-04-08 11:11:52,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939895509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:52,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:52,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:11:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213061282] [2022-04-08 11:11:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:52,997 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-08 11:11:52,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:53,001 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-08 11:11:53,023 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-08 11:11:53,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:11:53,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:11:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:11:53,049 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-08 11:11:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:53,311 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-08 11:11:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:11:53,312 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-08 11:11:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:53,313 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-08 11:11:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 11:11:53,327 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-08 11:11:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 11:11:53,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-08 11:11:53,439 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-08 11:11:53,447 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:11:53,447 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:11:53,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:11:53,453 INFO L913 BasicCegarLoop]: 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-08 11:11:53,454 INFO L914 BasicCegarLoop]: 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-08 11:11:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:11:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 11:11:53,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:53,479 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-08 11:11:53,479 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-08 11:11:53,480 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-08 11:11:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:53,484 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-08 11:11:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-08 11:11:53,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:53,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:53,486 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-08 11:11:53,486 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-08 11:11:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:53,489 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-08 11:11:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-08 11:11:53,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:53,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:53,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:53,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:53,491 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-08 11:11:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-08 11:11:53,496 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-08 11:11:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:53,496 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-08 11:11:53,497 INFO L479 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-08 11:11:53,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-08 11:11:53,538 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-08 11:11:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-08 11:11:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:11:53,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:53,539 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:53,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:11:53,539 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:53,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-08 11:11:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:53,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [693250427] [2022-04-08 11:11:53,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:11:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-08 11:11:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:53,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506355267] [2022-04-08 11:11:53,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:11:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:53,611 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-08 11:11:53,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:11:53,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:11:53,613 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-08 11:11:53,614 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-08 11:11:53,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:11:53,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:11:53,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-08 11:11:53,616 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-08 11:11:53,617 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-08 11:11:53,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {263#false} is VALID [2022-04-08 11:11:53,617 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-08 11:11:53,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-08 11:11:53,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-08 11:11:53,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 11:11:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:11:53,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:53,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506355267] [2022-04-08 11:11:53,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506355267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:53,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:53,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:11:53,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [693250427] [2022-04-08 11:11:53,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [693250427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:53,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:53,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:11:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063439469] [2022-04-08 11:11:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:53,621 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-08 11:11:53,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:53,621 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-08 11:11:53,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:53,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:11:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:53,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:11:53,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:11:53,636 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-08 11:11:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:57,000 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-08 11:11:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:11:57,000 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-08 11:11:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:57,001 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-08 11:11:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 11:11:57,003 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-08 11:11:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 11:11:57,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-08 11:11:57,110 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-08 11:11:57,113 INFO L225 Difference]: With dead ends: 40 [2022-04-08 11:11:57,114 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 11:11:57,114 INFO L912 BasicCegarLoop]: 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-08 11:11:57,117 INFO L913 BasicCegarLoop]: 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-08 11:11:57,118 INFO L914 BasicCegarLoop]: 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-08 11:11:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 11:11:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 11:11:57,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:57,131 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-08 11:11:57,131 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-08 11:11:57,132 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-08 11:11:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:57,138 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 11:11:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:11:57,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:57,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:57,146 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-08 11:11:57,146 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-08 11:11:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:57,152 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 11:11:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:11:57,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:57,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:57,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:57,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:57,154 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-08 11:11:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-08 11:11:57,160 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-08 11:11:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:57,161 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-08 11:11:57,161 INFO L479 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-08 11:11:57,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-08 11:11:57,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:11:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:11:57,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:57,205 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:57,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 11:11:57,206 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-08 11:11:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:57,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204501302] [2022-04-08 11:11:57,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:11:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-08 11:11:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:57,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911778622] [2022-04-08 11:11:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:11:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:57,361 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-08 11:11:57,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 11:11:57,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-08 11:11:57,363 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-08 11:11:57,363 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-08 11:11:57,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 11:11:57,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-08 11:11:57,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-08 11:11:57,365 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-08 11:11:57,365 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-08 11:11:57,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 20);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 11:11:57,368 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-08 11:11:57,369 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-08 11:11:57,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-08 11:11:57,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-08 11:11:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:11:57,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:57,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911778622] [2022-04-08 11:11:57,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911778622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:57,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:57,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:11:57,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:57,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204501302] [2022-04-08 11:11:57,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204501302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:57,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:57,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:11:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397197240] [2022-04-08 11:11:57,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:57,376 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-08 11:11:57,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:57,376 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-08 11:11:57,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:57,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:11:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:57,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:11:57,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:11:57,389 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-08 11:11:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:57,826 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 11:11:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:11:57,826 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-08 11:11:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:57,826 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-08 11:11:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 11:11:57,837 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-08 11:11:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 11:11:57,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-08 11:11:57,910 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-08 11:11:57,912 INFO L225 Difference]: With dead ends: 34 [2022-04-08 11:11:57,912 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 11:11:57,912 INFO L912 BasicCegarLoop]: 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-08 11:11:57,913 INFO L913 BasicCegarLoop]: 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-08 11:11:57,913 INFO L914 BasicCegarLoop]: 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-08 11:11:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 11:11:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 11:11:57,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:57,920 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-08 11:11:57,921 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-08 11:11:57,921 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-08 11:11:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:57,923 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 11:11:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:11:57,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:57,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:57,924 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-08 11:11:57,925 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-08 11:11:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:57,927 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 11:11:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:11:57,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:57,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:57,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:57,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:57,928 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-08 11:11:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 11:11:57,932 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 11:11:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:57,932 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 11:11:57,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:11:57,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 11:11:57,982 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-08 11:11:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:11:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:11:57,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:57,983 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:57,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 11:11:57,986 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:57,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-08 11:11:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:57,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [297524594] [2022-04-08 11:11:57,990 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:11:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-08 11:11:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:57,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064734174] [2022-04-08 11:11:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:58,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:58,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839180116] [2022-04-08 11:11:58,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:11:58,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:58,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:58,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:58,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 11:11:58,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:11:58,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:58,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:11:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:58,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:58,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-08 11:11:58,201 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-08 11:11:58,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-08 11:11:58,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-08 11:11:58,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-08 11:11:58,203 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-08 11:11:58,203 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-08 11:11:58,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:11:58,204 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-08 11:11:58,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-08 11:11:58,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-08 11:11:58,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-08 11:11:58,205 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-08 11:11:58,206 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-08 11:11:58,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:58,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-08 11:11:58,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-08 11:11:58,208 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-08 11:11:58,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:11:58,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:58,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064734174] [2022-04-08 11:11:58,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:58,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839180116] [2022-04-08 11:11:58,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839180116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:58,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:58,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:11:58,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:58,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [297524594] [2022-04-08 11:11:58,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [297524594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:58,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:58,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:11:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088312060] [2022-04-08 11:11:58,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:58,211 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-08 11:11:58,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:58,211 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-08 11:11:58,225 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-08 11:11:58,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:11:58,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:58,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:11:58,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:11:58,226 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-08 11:12:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:00,948 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-08 11:12:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:12:00,948 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-08 11:12:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:00,948 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-08 11:12:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:00,951 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-08 11:12:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:00,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:12:01,036 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-08 11:12:01,039 INFO L225 Difference]: With dead ends: 50 [2022-04-08 11:12:01,039 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 11:12:01,039 INFO L912 BasicCegarLoop]: 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-08 11:12:01,041 INFO L913 BasicCegarLoop]: 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-08 11:12:01,042 INFO L914 BasicCegarLoop]: 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-08 11:12:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 11:12:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-08 11:12:01,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:01,056 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-08 11:12:01,056 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-08 11:12:01,057 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-08 11:12:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:01,060 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-08 11:12:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-08 11:12:01,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:01,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:01,061 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-08 11:12:01,061 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-08 11:12:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:01,067 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-08 11:12:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-08 11:12:01,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:01,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:01,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:01,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:01,069 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-08 11:12:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-08 11:12:01,071 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-08 11:12:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:01,071 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-08 11:12:01,072 INFO L479 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-08 11:12:01,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-08 11:12:01,129 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-08 11:12:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-08 11:12:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 11:12:01,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:01,130 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:01,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:01,339 WARN L460 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-08 11:12:01,340 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-08 11:12:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:01,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [797493278] [2022-04-08 11:12:01,341 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-08 11:12:01,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:01,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032934615] [2022-04-08 11:12:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:01,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:01,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751434840] [2022-04-08 11:12:01,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:01,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:01,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:01,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:01,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 11:12:01,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:01,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:01,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:12:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:01,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:01,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-08 11:12:01,534 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-08 11:12:01,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:12:01,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-08 11:12:01,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-08 11:12:01,535 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-08 11:12:01,535 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-08 11:12:01,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:12:01,536 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-08 11:12:01,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-08 11:12:01,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-08 11:12:01,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:12:01,537 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-08 11:12:01,538 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-08 11:12:01,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-08 11:12:01,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-08 11:12:01,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:12:01,539 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-08 11:12:01,540 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-08 11:12:01,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:01,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-08 11:12:01,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-08 11:12:01,541 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-08 11:12:01,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:12:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:01,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032934615] [2022-04-08 11:12:01,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:01,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751434840] [2022-04-08 11:12:01,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751434840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:01,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:01,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:01,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:01,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [797493278] [2022-04-08 11:12:01,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [797493278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:01,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:01,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672066290] [2022-04-08 11:12:01,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:01,543 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-08 11:12:01,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:01,544 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-08 11:12:01,561 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-08 11:12:01,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:12:01,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:01,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:12:01,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:12:01,562 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-08 11:12:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:01,865 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-08 11:12:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:12:01,865 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-08 11:12:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:01,866 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-08 11:12:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:01,868 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-08 11:12:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:01,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:12:01,940 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-08 11:12:01,942 INFO L225 Difference]: With dead ends: 54 [2022-04-08 11:12:01,942 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 11:12:01,942 INFO L912 BasicCegarLoop]: 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-08 11:12:01,943 INFO L913 BasicCegarLoop]: 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-08 11:12:01,943 INFO L914 BasicCegarLoop]: 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-08 11:12:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 11:12:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-08 11:12:01,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:01,968 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-08 11:12:01,969 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-08 11:12:01,971 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-08 11:12:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:01,977 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 11:12:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 11:12:01,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:01,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:01,978 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-08 11:12:01,979 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-08 11:12:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:01,984 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 11:12:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 11:12:01,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:01,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:01,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:01,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:01,985 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-08 11:12:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-08 11:12:01,988 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-08 11:12:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:01,988 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-08 11:12:01,989 INFO L479 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-08 11:12:01,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-08 11:12:02,076 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-08 11:12:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-08 11:12:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:12:02,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:02,077 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:02,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:02,279 WARN L460 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-08 11:12:02,280 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:02,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-08 11:12:02,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:02,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1739953034] [2022-04-08 11:12:02,281 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-08 11:12:02,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:02,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378059211] [2022-04-08 11:12:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:02,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:02,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:02,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617692218] [2022-04-08 11:12:02,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:02,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:02,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:02,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:02,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 11:12:02,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:02,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:02,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:12:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:02,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:02,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-08 11:12:02,509 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-08 11:12:02,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:12:02,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-08 11:12:02,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-08 11:12:02,510 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-08 11:12:02,510 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-08 11:12:02,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:02,511 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-08 11:12:02,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:12:02,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:12:02,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:12:02,513 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-08 11:12:02,513 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-08 11:12:02,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:12:02,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:12:02,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:12:02,514 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-08 11:12:02,514 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-08 11:12:02,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:12:02,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:12:02,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:12:02,518 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-08 11:12:02,519 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-08 11:12:02,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:02,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-08 11:12:02,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-08 11:12:02,520 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-08 11:12:02,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:12:02,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:02,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378059211] [2022-04-08 11:12:02,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:02,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617692218] [2022-04-08 11:12:02,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617692218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:02,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:02,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:02,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:02,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1739953034] [2022-04-08 11:12:02,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1739953034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:02,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:02,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679933152] [2022-04-08 11:12:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:02,522 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-08 11:12:02,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:02,523 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-08 11:12:02,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:02,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:12:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:12:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:12:02,543 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-08 11:12:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:02,905 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-08 11:12:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:12:02,905 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-08 11:12:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:02,905 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-08 11:12:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:02,907 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-08 11:12:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:02,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:12:02,980 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-08 11:12:02,981 INFO L225 Difference]: With dead ends: 62 [2022-04-08 11:12:02,981 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 11:12:02,982 INFO L912 BasicCegarLoop]: 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-08 11:12:02,982 INFO L913 BasicCegarLoop]: 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-08 11:12:02,983 INFO L914 BasicCegarLoop]: 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-08 11:12:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 11:12:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 11:12:03,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:03,004 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-08 11:12:03,004 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-08 11:12:03,005 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-08 11:12:03,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:03,007 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-08 11:12:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:12:03,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:03,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:03,008 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-08 11:12:03,008 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-08 11:12:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:03,010 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-08 11:12:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:12:03,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:03,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:03,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:03,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:03,011 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-08 11:12:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-08 11:12:03,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-08 11:12:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:03,014 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-08 11:12:03,014 INFO L479 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-08 11:12:03,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-08 11:12:03,083 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-08 11:12:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:12:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:12:03,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:03,084 INFO L499 BasicCegarLoop]: 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-08 11:12:03,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:03,303 WARN L460 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-08 11:12:03,303 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:03,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-08 11:12:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:03,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912277647] [2022-04-08 11:12:03,765 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:03,765 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-08 11:12:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:03,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512481350] [2022-04-08 11:12:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:03,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:03,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894211795] [2022-04-08 11:12:03,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:03,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:03,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:03,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:03,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 11:12:03,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:03,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:03,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:12:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:03,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:04,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-08 11:12:04,047 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-08 11:12:04,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:04,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:04,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:04,049 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-08 11:12:04,050 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-08 11:12:04,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,051 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-08 11:12:04,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,055 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,062 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-08 11:12:04,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,064 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,064 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-08 11:12:04,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,066 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,067 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-08 11:12:04,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,068 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,069 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-08 11:12:04,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,071 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:04,071 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-08 11:12:04,072 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-08 11:12:04,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1802#false} is VALID [2022-04-08 11:12:04,072 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-08 11:12:04,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:12:04,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-08 11:12:04,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-08 11:12:04,073 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-08 11:12:04,073 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-08 11:12:04,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:12:04,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-08 11:12:04,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-08 11:12:04,074 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-08 11:12:04,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:04,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-08 11:12:04,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-08 11:12:04,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:12:04,303 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-08 11:12:04,303 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-08 11:12:04,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:04,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:04,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:04,303 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-08 11:12:04,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1802#false} is VALID [2022-04-08 11:12:04,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {1972#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1968#(< |main_#t~post5| 20)} is VALID [2022-04-08 11:12:04,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {1972#(< ~counter~0 20)} 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 20)} is VALID [2022-04-08 11:12:04,312 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #67#return; {1972#(< ~counter~0 20)} is VALID [2022-04-08 11:12:04,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:04,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:04,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:04,313 INFO L272 TraceCheckUtils]: 28: Hoare triple {1972#(< ~counter~0 20)} 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-08 11:12:04,313 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #65#return; {1972#(< ~counter~0 20)} is VALID [2022-04-08 11:12:04,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:04,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:04,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:04,314 INFO L272 TraceCheckUtils]: 23: Hoare triple {1972#(< ~counter~0 20)} 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-08 11:12:04,315 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #63#return; {1972#(< ~counter~0 20)} is VALID [2022-04-08 11:12:04,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:04,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:04,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:04,316 INFO L272 TraceCheckUtils]: 18: Hoare triple {1972#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:12:04,317 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #61#return; {1972#(< ~counter~0 20)} is VALID [2022-04-08 11:12:04,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:04,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:04,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:04,317 INFO L272 TraceCheckUtils]: 13: Hoare triple {1972#(< ~counter~0 20)} 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-08 11:12:04,318 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #59#return; {1972#(< ~counter~0 20)} is VALID [2022-04-08 11:12:04,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:04,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:04,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:04,318 INFO L272 TraceCheckUtils]: 8: Hoare triple {1972#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:12:04,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1972#(< ~counter~0 20)} is VALID [2022-04-08 11:12:04,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {2057#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1972#(< ~counter~0 20)} is VALID [2022-04-08 11:12:04,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#(< ~counter~0 19)} 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 19)} is VALID [2022-04-08 11:12:04,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 19)} call #t~ret6 := main(); {2057#(< ~counter~0 19)} is VALID [2022-04-08 11:12:04,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 19)} {1801#true} #81#return; {2057#(< ~counter~0 19)} is VALID [2022-04-08 11:12:04,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 19)} assume true; {2057#(< ~counter~0 19)} is VALID [2022-04-08 11:12:04,324 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 19)} is VALID [2022-04-08 11:12:04,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-08 11:12:04,325 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-08 11:12:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:04,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512481350] [2022-04-08 11:12:04,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:04,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894211795] [2022-04-08 11:12:04,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894211795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:04,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:04,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 11:12:04,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912277647] [2022-04-08 11:12:04,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912277647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:04,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:04,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766497927] [2022-04-08 11:12:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:04,327 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-08 11:12:04,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:04,327 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-08 11:12:04,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:04,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:12:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:04,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:12:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:12:04,361 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-08 11:12:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,751 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-08 11:12:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:12:04,751 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-08 11:12:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:04,751 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-08 11:12:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 11:12:04,753 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-08 11:12:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 11:12:04,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-08 11:12:04,817 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-08 11:12:04,818 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:12:04,819 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 11:12:04,819 INFO L912 BasicCegarLoop]: 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-08 11:12:04,820 INFO L913 BasicCegarLoop]: 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-08 11:12:04,820 INFO L914 BasicCegarLoop]: 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-08 11:12:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 11:12:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 11:12:04,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:04,859 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-08 11:12:04,859 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-08 11:12:04,860 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-08 11:12:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,862 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:12:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:12:04,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:04,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:04,863 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-08 11:12:04,863 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-08 11:12:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,865 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:12:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:12:04,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:04,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:04,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:04,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:04,866 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-08 11:12:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 11:12:04,869 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-08 11:12:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:04,869 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 11:12:04,869 INFO L479 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-08 11:12:04,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 11:12:04,961 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-08 11:12:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:12:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:12:04,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:04,963 INFO L499 BasicCegarLoop]: 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-08 11:12:04,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 11:12:05,175 WARN L460 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-08 11:12:05,175 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-08 11:12:05,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:05,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281917039] [2022-04-08 11:12:05,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:05,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-08 11:12:05,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:05,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675266637] [2022-04-08 11:12:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:05,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:05,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:05,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999050618] [2022-04-08 11:12:05,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:05,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:05,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:05,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:05,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 11:12:05,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:05,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:05,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:12:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:05,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:05,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-08 11:12:05,927 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-08 11:12:05,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:05,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-08 11:12:05,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-08 11:12:05,928 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-08 11:12:05,928 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-08 11:12:05,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:05,929 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-08 11:12:05,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:05,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:05,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:05,930 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-08 11:12:05,930 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-08 11:12:05,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:05,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:05,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:05,931 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-08 11:12:05,931 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-08 11:12:05,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:05,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:05,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:05,932 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-08 11:12:05,932 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-08 11:12:05,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:05,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:05,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:05,933 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-08 11:12:05,933 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-08 11:12:05,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:05,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:05,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:05,934 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-08 11:12:05,935 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-08 11:12:05,935 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-08 11:12:05,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:12:05,936 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-08 11:12:05,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:05,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:05,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:05,936 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-08 11:12:05,937 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-08 11:12:05,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:05,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-08 11:12:05,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-08 11:12:05,938 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-08 11:12:05,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:06,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-08 11:12:06,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-08 11:12:06,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:06,180 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-08 11:12:06,181 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-08 11:12:06,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:06,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:06,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:06,182 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-08 11:12:06,183 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 < 20);havoc #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:12:06,186 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-08 11:12:06,192 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-08 11:12:06,193 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-08 11:12:06,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:06,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:06,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:06,193 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-08 11:12:06,194 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-08 11:12:06,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:06,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:06,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:06,195 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-08 11:12:06,195 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-08 11:12:06,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:06,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:06,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:06,196 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-08 11:12:06,196 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-08 11:12:06,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:06,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:06,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:06,197 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-08 11:12:06,197 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-08 11:12:06,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:06,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:06,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:06,198 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-08 11:12:06,198 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 < 20);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-08 11:12:06,199 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-08 11:12:06,199 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-08 11:12:06,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-08 11:12:06,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-08 11:12:06,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:06,200 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-08 11:12:06,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-08 11:12:06,200 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-08 11:12:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:06,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675266637] [2022-04-08 11:12:06,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:06,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999050618] [2022-04-08 11:12:06,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999050618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:06,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:06,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 11:12:06,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:06,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281917039] [2022-04-08 11:12:06,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281917039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:06,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:06,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:12:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20947760] [2022-04-08 11:12:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:06,202 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-08 11:12:06,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:06,203 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-08 11:12:06,228 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-08 11:12:06,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:12:06,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:12:06,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:12:06,229 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-08 11:12:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:06,745 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-08 11:12:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:12:06,746 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-08 11:12:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:06,749 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-08 11:12:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-08 11:12:06,753 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-08 11:12:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-08 11:12:06,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-08 11:12:06,838 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-08 11:12:06,840 INFO L225 Difference]: With dead ends: 78 [2022-04-08 11:12:06,840 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 11:12:06,840 INFO L912 BasicCegarLoop]: 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-08 11:12:06,841 INFO L913 BasicCegarLoop]: 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-08 11:12:06,841 INFO L914 BasicCegarLoop]: 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-08 11:12:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 11:12:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-08 11:12:06,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:06,896 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-08 11:12:06,897 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-08 11:12:06,897 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-08 11:12:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:06,901 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 11:12:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-08 11:12:06,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:06,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:06,902 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-08 11:12:06,902 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-08 11:12:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:06,906 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 11:12:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-08 11:12:06,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:06,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:06,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:06,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:06,907 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-08 11:12:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-08 11:12:06,909 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-08 11:12:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:06,910 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-08 11:12:06,910 INFO L479 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-08 11:12:06,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-08 11:12:07,004 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-08 11:12:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-08 11:12:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:12:07,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:07,005 INFO L499 BasicCegarLoop]: 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-08 11:12:07,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:07,207 WARN L460 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-08 11:12:07,208 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:07,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:07,208 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-08 11:12:07,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:07,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967116277] [2022-04-08 11:12:07,564 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:07,564 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-08 11:12:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:07,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868870256] [2022-04-08 11:12:07,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:07,589 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56831494] [2022-04-08 11:12:07,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:07,595 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:07,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 11:12:07,652 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:12:07,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:07,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 11:12:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:07,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:07,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-08 11:12:07,975 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-08 11:12:07,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:07,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-08 11:12:07,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-08 11:12:07,975 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-08 11:12:07,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-08 11:12:07,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 20);havoc #t~post5; {3167#true} is VALID [2022-04-08 11:12:07,976 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-08 11:12:07,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:07,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:07,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:07,976 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-08 11:12:07,976 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-08 11:12:07,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:07,977 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-08 11:12:07,978 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-08 11:12:07,979 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-08 11:12:07,979 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-08 11:12:07,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:07,980 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-08 11:12:07,980 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-08 11:12:07,981 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-08 11:12:07,981 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-08 11:12:07,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:07,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:07,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:07,982 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-08 11:12:07,982 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-08 11:12:07,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:07,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:07,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:07,983 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-08 11:12:07,990 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-08 11:12:07,991 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-08 11:12:07,991 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 < 20);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-08 11:12:07,991 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-08 11:12:07,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:07,992 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-08 11:12:07,994 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-08 11:12:07,996 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-08 11:12:07,996 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-08 11:12:07,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:07,996 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-08 11:12:07,997 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-08 11:12:07,997 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-08 11:12:07,998 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-08 11:12:07,998 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:07,999 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-08 11:12:07,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-08 11:12:07,999 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-08 11:12:07,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:08,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-08 11:12:08,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-08 11:12:08,678 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:08,678 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-08 11:12:08,679 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-08 11:12:08,679 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-08 11:12:08,680 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-08 11:12:08,680 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-08 11:12:08,680 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-08 11:12:08,681 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-08 11:12:08,681 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-08 11:12:08,682 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-08 11:12:08,682 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-08 11:12:08,682 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-08 11:12:08,683 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 < 20);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-08 11:12:08,683 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-08 11:12:08,691 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-08 11:12:08,692 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-08 11:12:08,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:08,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:08,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:08,692 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-08 11:12:08,693 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-08 11:12:08,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:08,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:08,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:08,694 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-08 11:12:08,694 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-08 11:12:08,695 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-08 11:12:08,695 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-08 11:12:08,696 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-08 11:12:08,696 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-08 11:12:08,696 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-08 11:12:08,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:08,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:08,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:08,696 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-08 11:12:08,699 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-08 11:12:08,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:08,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:08,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:08,709 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-08 11:12:08,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 20);havoc #t~post5; {3167#true} is VALID [2022-04-08 11:12:08,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-08 11:12:08,709 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-08 11:12:08,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-08 11:12:08,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-08 11:12:08,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:08,710 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-08 11:12:08,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-08 11:12:08,710 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-08 11:12:08,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868870256] [2022-04-08 11:12:08,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56831494] [2022-04-08 11:12:08,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56831494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:08,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:08,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-08 11:12:08,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:08,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [967116277] [2022-04-08 11:12:08,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [967116277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:08,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:08,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:12:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079185213] [2022-04-08 11:12:08,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:08,712 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-08 11:12:08,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:08,713 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-08 11:12:08,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:08,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:12:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:08,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:12:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:12:08,781 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-08 11:12:12,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:12:15,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:12:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:15,490 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-04-08 11:12:15,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:12:15,490 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-08 11:12:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:15,490 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-08 11:12:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 11:12:15,492 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-08 11:12:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 11:12:15,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 11:12:17,046 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-08 11:12:17,049 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:12:17,049 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 11:12:17,049 INFO L912 BasicCegarLoop]: 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-08 11:12:17,050 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:17,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 152 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 11:12:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 11:12:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 11:12:17,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:17,113 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-08 11:12:17,113 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-08 11:12:17,113 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-08 11:12:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:17,116 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-08 11:12:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:12:17,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:17,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:17,116 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-08 11:12:17,117 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-08 11:12:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:17,119 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-08 11:12:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:12:17,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:17,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:17,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:17,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:17,121 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-08 11:12:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-08 11:12:17,123 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 50 [2022-04-08 11:12:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:17,123 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-08 11:12:17,123 INFO L479 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-08 11:12:17,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-08 11:12:19,301 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-08 11:12:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:12:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 11:12:19,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:19,302 INFO L499 BasicCegarLoop]: 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-08 11:12:19,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:19,503 WARN L460 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-08 11:12:19,504 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-08 11:12:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:19,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1567810860] [2022-04-08 11:12:19,838 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:19,838 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-08 11:12:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:19,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566683110] [2022-04-08 11:12:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:19,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:19,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:19,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568784353] [2022-04-08 11:12:19,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:19,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:19,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:19,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:19,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 11:12:19,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:19,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:19,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 11:12:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:19,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:20,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {3898#true} call ULTIMATE.init(); {3898#true} is VALID [2022-04-08 11:12:20,552 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-08 11:12:20,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3898#true} {3898#true} #81#return; {3898#true} is VALID [2022-04-08 11:12:20,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {3898#true} call #t~ret6 := main(); {3898#true} is VALID [2022-04-08 11:12:20,553 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-08 11:12:20,554 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-08 11:12:20,555 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 < 20);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-08 11:12:20,555 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-08 11:12:20,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,556 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-08 11:12:20,556 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-08 11:12:20,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,557 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-08 11:12:20,557 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-08 11:12:20,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,558 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-08 11:12:20,558 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-08 11:12:20,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,559 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-08 11:12:20,559 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-08 11:12:20,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,560 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-08 11:12:20,560 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-08 11:12:20,561 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-08 11:12:20,561 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 < 20);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-08 11:12:20,561 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-08 11:12:20,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,562 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-08 11:12:20,562 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-08 11:12:20,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,563 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-08 11:12:20,564 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-08 11:12:20,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,564 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-08 11:12:20,565 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-08 11:12:20,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,565 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-08 11:12:20,566 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-08 11:12:20,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,566 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-08 11:12:20,567 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-08 11:12:20,567 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-08 11:12:20,568 INFO L290 TraceCheckUtils]: 63: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:20,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:20,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:20,568 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-08 11:12:20,569 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-08 11:12:20,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {4107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:20,570 INFO L290 TraceCheckUtils]: 69: Hoare triple {4111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3899#false} is VALID [2022-04-08 11:12:20,570 INFO L290 TraceCheckUtils]: 70: Hoare triple {3899#false} assume !false; {3899#false} is VALID [2022-04-08 11:12:20,570 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-08 11:12:20,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:21,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566683110] [2022-04-08 11:12:21,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568784353] [2022-04-08 11:12:21,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568784353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:12:21,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:12:21,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 11:12:21,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:21,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1567810860] [2022-04-08 11:12:21,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1567810860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:21,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:21,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:12:21,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418220942] [2022-04-08 11:12:21,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:21,028 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-08 11:12:21,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:21,029 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-08 11:12:21,071 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-08 11:12:21,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:12:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:21,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:12:21,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:12:21,072 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-08 11:12:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:21,632 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-04-08 11:12:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:12:21,632 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-08 11:12:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:21,632 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-08 11:12:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:12:21,634 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-08 11:12:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:12:21,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 11:12:21,701 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-08 11:12:21,703 INFO L225 Difference]: With dead ends: 84 [2022-04-08 11:12:21,704 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 11:12:21,704 INFO L912 BasicCegarLoop]: 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-08 11:12:21,704 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:21,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 11:12:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 11:12:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-08 11:12:21,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:21,774 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-08 11:12:21,774 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-08 11:12:21,775 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-08 11:12:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:21,778 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-08 11:12:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-08 11:12:21,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:21,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:21,779 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-08 11:12:21,779 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-08 11:12:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:21,782 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-08 11:12:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-08 11:12:21,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:21,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:21,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:21,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:21,783 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-08 11:12:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-04-08 11:12:21,786 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 71 [2022-04-08 11:12:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:21,786 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-04-08 11:12:21,786 INFO L479 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-08 11:12:21,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 92 transitions. [2022-04-08 11:12:21,923 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-08 11:12:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-08 11:12:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 11:12:21,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:21,924 INFO L499 BasicCegarLoop]: 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-08 11:12:21,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:22,127 WARN L460 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-08 11:12:22,128 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-08 11:12:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:22,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888490260] [2022-04-08 11:12:22,453 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:22,454 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-08 11:12:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:22,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957775901] [2022-04-08 11:12:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:22,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:22,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032412311] [2022-04-08 11:12:22,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:22,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:22,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:22,474 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-08 11:12:22,475 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-08 11:12:22,522 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:12:22,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:22,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:12:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:22,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:22,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2022-04-08 11:12:22,810 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-08 11:12:22,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {4743#(<= ~counter~0 0)} assume true; {4743#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:22,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4743#(<= ~counter~0 0)} {4735#true} #81#return; {4743#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:22,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {4743#(<= ~counter~0 0)} call #t~ret6 := main(); {4743#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:22,811 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-08 11:12:22,812 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-08 11:12:22,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {4759#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,813 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-08 11:12:22,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,815 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #59#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,816 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-08 11:12:22,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,817 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #61#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,818 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-08 11:12:22,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,819 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #63#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,820 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-08 11:12:22,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,822 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #65#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,822 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-08 11:12:22,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,824 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #67#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:22,824 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-08 11:12:22,825 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-08 11:12:22,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {4844#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,826 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-08 11:12:22,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,828 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #59#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,828 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-08 11:12:22,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,829 INFO L290 TraceCheckUtils]: 43: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,830 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #61#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,830 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-08 11:12:22,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,832 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #63#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,832 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-08 11:12:22,833 INFO L290 TraceCheckUtils]: 52: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,833 INFO L290 TraceCheckUtils]: 53: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,834 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #65#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,835 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-08 11:12:22,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,836 INFO L290 TraceCheckUtils]: 59: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,836 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #67#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:22,837 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-08 11:12:22,837 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-08 11:12:22,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {4929#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {4736#false} is VALID [2022-04-08 11:12:22,838 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-08 11:12:22,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-08 11:12:22,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {4736#false} assume !(0 == ~cond); {4736#false} is VALID [2022-04-08 11:12:22,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {4736#false} assume true; {4736#false} is VALID [2022-04-08 11:12:22,838 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4736#false} {4736#false} #69#return; {4736#false} is VALID [2022-04-08 11:12:22,838 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-08 11:12:22,838 INFO L290 TraceCheckUtils]: 70: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-08 11:12:22,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {4736#false} assume 0 == ~cond; {4736#false} is VALID [2022-04-08 11:12:22,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2022-04-08 11:12:22,839 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-08 11:12:22,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:23,215 INFO L290 TraceCheckUtils]: 72: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2022-04-08 11:12:23,215 INFO L290 TraceCheckUtils]: 71: Hoare triple {4736#false} assume 0 == ~cond; {4736#false} is VALID [2022-04-08 11:12:23,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-08 11:12:23,216 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-08 11:12:23,216 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4735#true} {4736#false} #69#return; {4736#false} is VALID [2022-04-08 11:12:23,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,216 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-08 11:12:23,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {4987#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4736#false} is VALID [2022-04-08 11:12:23,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {4991#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4987#(< |main_#t~post5| 20)} is VALID [2022-04-08 11:12:23,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {4991#(< ~counter~0 20)} 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 20)} is VALID [2022-04-08 11:12:23,217 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #67#return; {4991#(< ~counter~0 20)} is VALID [2022-04-08 11:12:23,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,218 INFO L290 TraceCheckUtils]: 57: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,218 INFO L272 TraceCheckUtils]: 56: Hoare triple {4991#(< ~counter~0 20)} 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-08 11:12:23,218 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #65#return; {4991#(< ~counter~0 20)} is VALID [2022-04-08 11:12:23,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,219 INFO L272 TraceCheckUtils]: 51: Hoare triple {4991#(< ~counter~0 20)} 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-08 11:12:23,223 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #63#return; {4991#(< ~counter~0 20)} is VALID [2022-04-08 11:12:23,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,224 INFO L272 TraceCheckUtils]: 46: Hoare triple {4991#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,224 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #61#return; {4991#(< ~counter~0 20)} is VALID [2022-04-08 11:12:23,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,225 INFO L272 TraceCheckUtils]: 41: Hoare triple {4991#(< ~counter~0 20)} 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-08 11:12:23,225 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #59#return; {4991#(< ~counter~0 20)} is VALID [2022-04-08 11:12:23,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,226 INFO L272 TraceCheckUtils]: 36: Hoare triple {4991#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {4991#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4991#(< ~counter~0 20)} is VALID [2022-04-08 11:12:23,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {5076#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4991#(< ~counter~0 20)} is VALID [2022-04-08 11:12:23,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {5076#(< ~counter~0 19)} 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 19)} is VALID [2022-04-08 11:12:23,227 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #67#return; {5076#(< ~counter~0 19)} is VALID [2022-04-08 11:12:23,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,227 INFO L272 TraceCheckUtils]: 28: Hoare triple {5076#(< ~counter~0 19)} 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-08 11:12:23,228 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #65#return; {5076#(< ~counter~0 19)} is VALID [2022-04-08 11:12:23,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,228 INFO L272 TraceCheckUtils]: 23: Hoare triple {5076#(< ~counter~0 19)} 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-08 11:12:23,229 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #63#return; {5076#(< ~counter~0 19)} is VALID [2022-04-08 11:12:23,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,229 INFO L272 TraceCheckUtils]: 18: Hoare triple {5076#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,229 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #61#return; {5076#(< ~counter~0 19)} is VALID [2022-04-08 11:12:23,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,230 INFO L272 TraceCheckUtils]: 13: Hoare triple {5076#(< ~counter~0 19)} 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-08 11:12:23,230 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #59#return; {5076#(< ~counter~0 19)} is VALID [2022-04-08 11:12:23,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,230 INFO L272 TraceCheckUtils]: 8: Hoare triple {5076#(< ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {5076#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5076#(< ~counter~0 19)} is VALID [2022-04-08 11:12:23,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {5161#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5076#(< ~counter~0 19)} is VALID [2022-04-08 11:12:23,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#(< ~counter~0 18)} 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 18)} is VALID [2022-04-08 11:12:23,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#(< ~counter~0 18)} call #t~ret6 := main(); {5161#(< ~counter~0 18)} is VALID [2022-04-08 11:12:23,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#(< ~counter~0 18)} {4735#true} #81#return; {5161#(< ~counter~0 18)} is VALID [2022-04-08 11:12:23,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#(< ~counter~0 18)} assume true; {5161#(< ~counter~0 18)} is VALID [2022-04-08 11:12:23,233 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 18)} is VALID [2022-04-08 11:12:23,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2022-04-08 11:12:23,233 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-08 11:12:23,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:23,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957775901] [2022-04-08 11:12:23,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:23,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032412311] [2022-04-08 11:12:23,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032412311] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:23,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:23,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:12:23,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:23,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888490260] [2022-04-08 11:12:23,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888490260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:23,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:23,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:12:23,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746061564] [2022-04-08 11:12:23,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:23,235 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-08 11:12:23,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:23,236 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-08 11:12:23,273 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-08 11:12:23,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:12:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:12:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:12:23,274 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-08 11:12:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:23,734 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-08 11:12:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:12:23,734 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-08 11:12:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:23,735 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-08 11:12:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 11:12:23,738 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-08 11:12:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 11:12:23,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-08 11:12:23,816 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-08 11:12:23,818 INFO L225 Difference]: With dead ends: 111 [2022-04-08 11:12:23,818 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 11:12:23,818 INFO L912 BasicCegarLoop]: 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-08 11:12:23,819 INFO L913 BasicCegarLoop]: 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-08 11:12:23,819 INFO L914 BasicCegarLoop]: 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-08 11:12:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 11:12:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-08 11:12:23,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:23,944 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-08 11:12:23,944 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-08 11:12:23,944 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-08 11:12:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:23,947 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:12:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:12:23,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:23,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:23,948 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-08 11:12:23,948 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-08 11:12:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:23,951 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:12:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:12:23,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:23,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:23,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:23,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:23,951 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-08 11:12:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-04-08 11:12:23,954 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 73 [2022-04-08 11:12:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:23,954 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-04-08 11:12:23,954 INFO L479 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-08 11:12:23,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 103 transitions. [2022-04-08 11:12:24,134 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-08 11:12:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-04-08 11:12:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 11:12:24,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:24,135 INFO L499 BasicCegarLoop]: 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-08 11:12:24,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:24,335 WARN L460 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-08 11:12:24,336 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-08 11:12:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:24,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476700916] [2022-04-08 11:12:24,651 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:24,651 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-08 11:12:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:24,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432872830] [2022-04-08 11:12:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:24,660 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939519997] [2022-04-08 11:12:24,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:24,668 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-08 11:12:24,690 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-08 11:12:24,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:24,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:24,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:12:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:24,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:25,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {5788#true} call ULTIMATE.init(); {5788#true} is VALID [2022-04-08 11:12:25,468 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-08 11:12:25,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5788#true} {5788#true} #81#return; {5788#true} is VALID [2022-04-08 11:12:25,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {5788#true} call #t~ret6 := main(); {5788#true} is VALID [2022-04-08 11:12:25,469 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-08 11:12:25,470 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-08 11:12:25,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 20);havoc #t~post5; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,470 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-08 11:12:25,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,471 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-08 11:12:25,471 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-08 11:12:25,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,472 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-08 11:12:25,472 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-08 11:12:25,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,473 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-08 11:12:25,474 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-08 11:12:25,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,475 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-08 11:12:25,475 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-08 11:12:25,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,476 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-08 11:12:25,477 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-08 11:12:25,477 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-08 11:12:25,478 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 < 20);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-08 11:12:25,478 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-08 11:12:25,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,479 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-08 11:12:25,479 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-08 11:12:25,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,480 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-08 11:12:25,480 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-08 11:12:25,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,484 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-08 11:12:25,484 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-08 11:12:25,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,485 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-08 11:12:25,485 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-08 11:12:25,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,486 INFO L290 TraceCheckUtils]: 58: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,486 INFO L290 TraceCheckUtils]: 59: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,486 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-08 11:12:25,487 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-08 11:12:25,487 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-08 11:12:25,487 INFO L290 TraceCheckUtils]: 63: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,488 INFO L290 TraceCheckUtils]: 64: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,488 INFO L290 TraceCheckUtils]: 65: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,488 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-08 11:12:25,488 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-08 11:12:25,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,489 INFO L290 TraceCheckUtils]: 69: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,489 INFO L290 TraceCheckUtils]: 70: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,489 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-08 11:12:25,491 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-08 11:12:25,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {6012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:25,492 INFO L290 TraceCheckUtils]: 74: Hoare triple {6016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5789#false} is VALID [2022-04-08 11:12:25,492 INFO L290 TraceCheckUtils]: 75: Hoare triple {5789#false} assume !false; {5789#false} is VALID [2022-04-08 11:12:25,492 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-08 11:12:25,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:31,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432872830] [2022-04-08 11:12:31,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:31,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939519997] [2022-04-08 11:12:31,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939519997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:12:31,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:12:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 11:12:31,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476700916] [2022-04-08 11:12:31,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476700916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:31,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:12:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335197703] [2022-04-08 11:12:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:31,922 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-08 11:12:31,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:31,922 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-08 11:12:31,963 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-08 11:12:31,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:12:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:31,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:12:31,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:12:31,964 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-08 11:12:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:32,538 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:12:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:12:32,539 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-08 11:12:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:32,539 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-08 11:12:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:12:32,541 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-08 11:12:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:12:32,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 11:12:32,610 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-08 11:12:32,612 INFO L225 Difference]: With dead ends: 96 [2022-04-08 11:12:32,612 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 11:12:32,613 INFO L912 BasicCegarLoop]: 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-08 11:12:32,613 INFO L913 BasicCegarLoop]: 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-08 11:12:32,613 INFO L914 BasicCegarLoop]: 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-08 11:12:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 11:12:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 11:12:32,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:32,706 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-08 11:12:32,706 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-08 11:12:32,706 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-08 11:12:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:32,709 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-08 11:12:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:12:32,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:32,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:32,710 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-08 11:12:32,710 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-08 11:12:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:32,712 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-08 11:12:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:12:32,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:32,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:32,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:32,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:32,713 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-08 11:12:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-04-08 11:12:32,715 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 76 [2022-04-08 11:12:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:32,715 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-04-08 11:12:32,715 INFO L479 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-08 11:12:32,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 92 transitions. [2022-04-08 11:12:32,855 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-08 11:12:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:12:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 11:12:32,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:32,856 INFO L499 BasicCegarLoop]: 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-08 11:12:32,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 11:12:33,067 WARN L460 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-08 11:12:33,067 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-08 11:12:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:33,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [381940408] [2022-04-08 11:12:33,361 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:33,361 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-08 11:12:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:33,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072324790] [2022-04-08 11:12:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:33,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:33,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584053398] [2022-04-08 11:12:33,372 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:33,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:33,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:33,380 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-08 11:12:33,381 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-08 11:12:33,444 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:12:33,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:33,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 11:12:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:33,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:34,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {6693#true} call ULTIMATE.init(); {6693#true} is VALID [2022-04-08 11:12:34,188 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-08 11:12:34,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6693#true} {6693#true} #81#return; {6693#true} is VALID [2022-04-08 11:12:34,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {6693#true} call #t~ret6 := main(); {6693#true} is VALID [2022-04-08 11:12:34,189 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-08 11:12:34,189 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-08 11:12:34,190 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 < 20);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-08 11:12:34,190 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-08 11:12:34,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,191 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-08 11:12:34,191 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-08 11:12:34,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,192 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-08 11:12:34,192 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-08 11:12:34,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,193 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-08 11:12:34,193 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-08 11:12:34,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,194 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-08 11:12:34,194 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-08 11:12:34,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,195 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-08 11:12:34,196 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-08 11:12:34,196 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-08 11:12:34,197 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 < 20);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-08 11:12:34,197 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-08 11:12:34,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,198 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-08 11:12:34,199 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-08 11:12:34,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,200 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-08 11:12:34,200 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-08 11:12:34,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,201 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-08 11:12:34,201 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-08 11:12:34,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {6693#true} ~cond := #in~cond; {6856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:34,202 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-08 11:12:34,202 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-08 11:12:34,203 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-08 11:12:34,203 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-08 11:12:34,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,203 INFO L290 TraceCheckUtils]: 59: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,204 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-08 11:12:34,205 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-08 11:12:34,205 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-08 11:12:34,206 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 < 20);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-08 11:12:34,206 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-08 11:12:34,206 INFO L290 TraceCheckUtils]: 65: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,206 INFO L290 TraceCheckUtils]: 66: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,206 INFO L290 TraceCheckUtils]: 67: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,207 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-08 11:12:34,207 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-08 11:12:34,207 INFO L290 TraceCheckUtils]: 70: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,207 INFO L290 TraceCheckUtils]: 71: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,207 INFO L290 TraceCheckUtils]: 72: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,208 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-08 11:12:34,208 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-08 11:12:34,208 INFO L290 TraceCheckUtils]: 75: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,208 INFO L290 TraceCheckUtils]: 76: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,208 INFO L290 TraceCheckUtils]: 77: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,209 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-08 11:12:34,209 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-08 11:12:34,209 INFO L290 TraceCheckUtils]: 80: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,209 INFO L290 TraceCheckUtils]: 81: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,209 INFO L290 TraceCheckUtils]: 82: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,210 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-08 11:12:34,210 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-08 11:12:34,210 INFO L290 TraceCheckUtils]: 85: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,210 INFO L290 TraceCheckUtils]: 86: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,210 INFO L290 TraceCheckUtils]: 87: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,211 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-08 11:12:34,212 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-08 11:12:34,212 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-08 11:12:34,212 INFO L290 TraceCheckUtils]: 91: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:34,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:34,212 INFO L290 TraceCheckUtils]: 93: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:34,213 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-08 11:12:34,213 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-08 11:12:34,214 INFO L290 TraceCheckUtils]: 96: Hoare triple {6989#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6993#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:34,214 INFO L290 TraceCheckUtils]: 97: Hoare triple {6993#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6694#false} is VALID [2022-04-08 11:12:34,214 INFO L290 TraceCheckUtils]: 98: Hoare triple {6694#false} assume !false; {6694#false} is VALID [2022-04-08 11:12:34,215 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-08 11:12:34,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:34,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:34,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072324790] [2022-04-08 11:12:34,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:34,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584053398] [2022-04-08 11:12:34,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584053398] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:12:34,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:12:34,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 11:12:34,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:34,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [381940408] [2022-04-08 11:12:34,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [381940408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:34,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:34,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:12:34,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994340203] [2022-04-08 11:12:34,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:34,615 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-08 11:12:34,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:34,616 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-08 11:12:34,670 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-08 11:12:34,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:12:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:34,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:12:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:12:34,671 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-08 11:12:35,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:35,874 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-08 11:12:35,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:12:35,874 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-08 11:12:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:35,875 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-08 11:12:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 11:12:35,877 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-08 11:12:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 11:12:35,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-08 11:12:35,981 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-08 11:12:35,983 INFO L225 Difference]: With dead ends: 100 [2022-04-08 11:12:35,983 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 11:12:35,983 INFO L912 BasicCegarLoop]: 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-08 11:12:35,984 INFO L913 BasicCegarLoop]: 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-08 11:12:35,984 INFO L914 BasicCegarLoop]: 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-08 11:12:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 11:12:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-08 11:12:36,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:36,081 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-08 11:12:36,081 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-08 11:12:36,081 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-08 11:12:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:36,084 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-08 11:12:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-08 11:12:36,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:36,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:36,085 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-08 11:12:36,085 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-08 11:12:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:36,088 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-08 11:12:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-08 11:12:36,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:36,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:36,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:36,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:36,089 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-08 11:12:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-04-08 11:12:36,091 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 99 [2022-04-08 11:12:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:36,092 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-04-08 11:12:36,092 INFO L479 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-08 11:12:36,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 111 transitions. [2022-04-08 11:12:36,632 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-08 11:12:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-08 11:12:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 11:12:36,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:36,635 INFO L499 BasicCegarLoop]: 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-08 11:12:36,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:36,835 WARN L460 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-08 11:12:36,836 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-08 11:12:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:36,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [229681711] [2022-04-08 11:12:37,133 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:37,133 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:37,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-08 11:12:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:37,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037689948] [2022-04-08 11:12:37,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:37,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:37,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:37,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137217104] [2022-04-08 11:12:37,149 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:12:37,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:37,150 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-08 11:12:37,151 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-08 11:12:37,386 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 11:12:37,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:37,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:12:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:37,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:37,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2022-04-08 11:12:37,782 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-08 11:12:37,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#(<= ~counter~0 0)} assume true; {7723#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:37,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#(<= ~counter~0 0)} {7715#true} #81#return; {7723#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:37,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {7723#(<= ~counter~0 0)} call #t~ret6 := main(); {7723#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:37,783 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-08 11:12:37,783 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-08 11:12:37,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {7739#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,784 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-08 11:12:37,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,785 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #59#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,786 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-08 11:12:37,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,787 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #61#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,788 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-08 11:12:37,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,789 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #63#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,789 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-08 11:12:37,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,791 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #65#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,791 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-08 11:12:37,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,793 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #67#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:37,793 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-08 11:12:37,793 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-08 11:12:37,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {7824#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,794 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-08 11:12:37,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,795 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #59#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,796 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-08 11:12:37,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,797 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #61#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,798 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-08 11:12:37,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,799 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #63#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,800 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-08 11:12:37,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,804 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #65#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,805 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-08 11:12:37,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,806 INFO L290 TraceCheckUtils]: 59: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,806 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #67#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:37,807 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-08 11:12:37,807 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-08 11:12:37,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {7909#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,808 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-08 11:12:37,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,810 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #59#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,811 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-08 11:12:37,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,811 INFO L290 TraceCheckUtils]: 71: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,812 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #61#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,813 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-08 11:12:37,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,814 INFO L290 TraceCheckUtils]: 77: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,814 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #63#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,815 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-08 11:12:37,815 INFO L290 TraceCheckUtils]: 80: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,816 INFO L290 TraceCheckUtils]: 82: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,817 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #65#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,817 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-08 11:12:37,818 INFO L290 TraceCheckUtils]: 85: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,818 INFO L290 TraceCheckUtils]: 86: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,818 INFO L290 TraceCheckUtils]: 87: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,819 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #67#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:37,819 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-08 11:12:37,820 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-08 11:12:37,820 INFO L290 TraceCheckUtils]: 91: Hoare triple {7994#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {7716#false} is VALID [2022-04-08 11:12:37,820 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-08 11:12:37,820 INFO L290 TraceCheckUtils]: 93: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-08 11:12:37,821 INFO L290 TraceCheckUtils]: 94: Hoare triple {7716#false} assume !(0 == ~cond); {7716#false} is VALID [2022-04-08 11:12:37,821 INFO L290 TraceCheckUtils]: 95: Hoare triple {7716#false} assume true; {7716#false} is VALID [2022-04-08 11:12:37,821 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7716#false} {7716#false} #69#return; {7716#false} is VALID [2022-04-08 11:12:37,821 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-08 11:12:37,821 INFO L290 TraceCheckUtils]: 98: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-08 11:12:37,821 INFO L290 TraceCheckUtils]: 99: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-08 11:12:37,821 INFO L290 TraceCheckUtils]: 100: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-08 11:12:37,822 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-08 11:12:37,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:38,275 INFO L290 TraceCheckUtils]: 100: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-08 11:12:38,275 INFO L290 TraceCheckUtils]: 99: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-08 11:12:38,275 INFO L290 TraceCheckUtils]: 98: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-08 11:12:38,275 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-08 11:12:38,276 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7715#true} {7716#false} #69#return; {7716#false} is VALID [2022-04-08 11:12:38,276 INFO L290 TraceCheckUtils]: 95: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,276 INFO L290 TraceCheckUtils]: 94: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,276 INFO L290 TraceCheckUtils]: 93: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,276 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-08 11:12:38,276 INFO L290 TraceCheckUtils]: 91: Hoare triple {8052#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7716#false} is VALID [2022-04-08 11:12:38,277 INFO L290 TraceCheckUtils]: 90: Hoare triple {8056#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8052#(< |main_#t~post5| 20)} is VALID [2022-04-08 11:12:38,277 INFO L290 TraceCheckUtils]: 89: Hoare triple {8056#(< ~counter~0 20)} 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 20)} is VALID [2022-04-08 11:12:38,278 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #67#return; {8056#(< ~counter~0 20)} is VALID [2022-04-08 11:12:38,278 INFO L290 TraceCheckUtils]: 87: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,278 INFO L290 TraceCheckUtils]: 86: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,278 INFO L290 TraceCheckUtils]: 85: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,278 INFO L272 TraceCheckUtils]: 84: Hoare triple {8056#(< ~counter~0 20)} 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-08 11:12:38,283 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #65#return; {8056#(< ~counter~0 20)} is VALID [2022-04-08 11:12:38,283 INFO L290 TraceCheckUtils]: 82: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,283 INFO L290 TraceCheckUtils]: 81: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,284 INFO L290 TraceCheckUtils]: 80: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,284 INFO L272 TraceCheckUtils]: 79: Hoare triple {8056#(< ~counter~0 20)} 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-08 11:12:38,284 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #63#return; {8056#(< ~counter~0 20)} is VALID [2022-04-08 11:12:38,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,285 INFO L290 TraceCheckUtils]: 76: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,285 INFO L290 TraceCheckUtils]: 75: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,285 INFO L272 TraceCheckUtils]: 74: Hoare triple {8056#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:38,285 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #61#return; {8056#(< ~counter~0 20)} is VALID [2022-04-08 11:12:38,285 INFO L290 TraceCheckUtils]: 72: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,286 INFO L290 TraceCheckUtils]: 71: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,286 INFO L290 TraceCheckUtils]: 70: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,286 INFO L272 TraceCheckUtils]: 69: Hoare triple {8056#(< ~counter~0 20)} 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-08 11:12:38,286 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #59#return; {8056#(< ~counter~0 20)} is VALID [2022-04-08 11:12:38,286 INFO L290 TraceCheckUtils]: 67: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,287 INFO L290 TraceCheckUtils]: 65: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,287 INFO L272 TraceCheckUtils]: 64: Hoare triple {8056#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:38,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {8056#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {8056#(< ~counter~0 20)} is VALID [2022-04-08 11:12:38,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {8141#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8056#(< ~counter~0 20)} is VALID [2022-04-08 11:12:38,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {8141#(< ~counter~0 19)} 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 19)} is VALID [2022-04-08 11:12:38,289 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #67#return; {8141#(< ~counter~0 19)} is VALID [2022-04-08 11:12:38,289 INFO L290 TraceCheckUtils]: 59: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,289 INFO L290 TraceCheckUtils]: 58: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,289 INFO L290 TraceCheckUtils]: 57: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,289 INFO L272 TraceCheckUtils]: 56: Hoare triple {8141#(< ~counter~0 19)} 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-08 11:12:38,290 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #65#return; {8141#(< ~counter~0 19)} is VALID [2022-04-08 11:12:38,290 INFO L290 TraceCheckUtils]: 54: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,290 INFO L290 TraceCheckUtils]: 53: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,290 INFO L290 TraceCheckUtils]: 52: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,290 INFO L272 TraceCheckUtils]: 51: Hoare triple {8141#(< ~counter~0 19)} 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-08 11:12:38,291 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #63#return; {8141#(< ~counter~0 19)} is VALID [2022-04-08 11:12:38,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,291 INFO L272 TraceCheckUtils]: 46: Hoare triple {8141#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:38,292 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #61#return; {8141#(< ~counter~0 19)} is VALID [2022-04-08 11:12:38,292 INFO L290 TraceCheckUtils]: 44: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,292 INFO L272 TraceCheckUtils]: 41: Hoare triple {8141#(< ~counter~0 19)} 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-08 11:12:38,293 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #59#return; {8141#(< ~counter~0 19)} is VALID [2022-04-08 11:12:38,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,293 INFO L272 TraceCheckUtils]: 36: Hoare triple {8141#(< ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:38,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {8141#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {8141#(< ~counter~0 19)} is VALID [2022-04-08 11:12:38,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {8226#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8141#(< ~counter~0 19)} is VALID [2022-04-08 11:12:38,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {8226#(< ~counter~0 18)} 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 18)} is VALID [2022-04-08 11:12:38,295 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #67#return; {8226#(< ~counter~0 18)} is VALID [2022-04-08 11:12:38,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,295 INFO L272 TraceCheckUtils]: 28: Hoare triple {8226#(< ~counter~0 18)} 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-08 11:12:38,296 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #65#return; {8226#(< ~counter~0 18)} is VALID [2022-04-08 11:12:38,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,296 INFO L272 TraceCheckUtils]: 23: Hoare triple {8226#(< ~counter~0 18)} 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-08 11:12:38,297 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #63#return; {8226#(< ~counter~0 18)} is VALID [2022-04-08 11:12:38,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,297 INFO L272 TraceCheckUtils]: 18: Hoare triple {8226#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:38,297 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #61#return; {8226#(< ~counter~0 18)} is VALID [2022-04-08 11:12:38,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,298 INFO L272 TraceCheckUtils]: 13: Hoare triple {8226#(< ~counter~0 18)} 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-08 11:12:38,298 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #59#return; {8226#(< ~counter~0 18)} is VALID [2022-04-08 11:12:38,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:38,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:38,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:38,299 INFO L272 TraceCheckUtils]: 8: Hoare triple {8226#(< ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:38,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {8226#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {8226#(< ~counter~0 18)} is VALID [2022-04-08 11:12:38,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {8311#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8226#(< ~counter~0 18)} is VALID [2022-04-08 11:12:38,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {8311#(< ~counter~0 17)} 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 17)} is VALID [2022-04-08 11:12:38,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {8311#(< ~counter~0 17)} call #t~ret6 := main(); {8311#(< ~counter~0 17)} is VALID [2022-04-08 11:12:38,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8311#(< ~counter~0 17)} {7715#true} #81#return; {8311#(< ~counter~0 17)} is VALID [2022-04-08 11:12:38,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {8311#(< ~counter~0 17)} assume true; {8311#(< ~counter~0 17)} is VALID [2022-04-08 11:12:38,302 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 17)} is VALID [2022-04-08 11:12:38,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2022-04-08 11:12:38,302 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-08 11:12:38,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:38,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037689948] [2022-04-08 11:12:38,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:38,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137217104] [2022-04-08 11:12:38,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137217104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:38,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:38,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:12:38,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:38,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [229681711] [2022-04-08 11:12:38,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [229681711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:38,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:38,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:12:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384406213] [2022-04-08 11:12:38,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:38,304 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-08 11:12:38,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:38,305 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-08 11:12:38,368 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-08 11:12:38,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:12:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:12:38,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:12:38,369 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-08 11:12:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:38,924 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-04-08 11:12:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:12:38,924 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-08 11:12:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:38,926 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-08 11:12:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-08 11:12:38,927 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-08 11:12:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-08 11:12:38,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-08 11:12:39,008 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-08 11:12:39,010 INFO L225 Difference]: With dead ends: 127 [2022-04-08 11:12:39,010 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 11:12:39,010 INFO L912 BasicCegarLoop]: 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-08 11:12:39,011 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:39,011 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 130 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 11:12:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-04-08 11:12:39,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:39,130 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-08 11:12:39,130 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-08 11:12:39,130 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-08 11:12:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:39,133 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-08 11:12:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-08 11:12:39,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:39,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:39,134 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-08 11:12:39,134 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-08 11:12:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:39,137 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-08 11:12:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-08 11:12:39,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:39,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:39,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:39,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:39,138 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-08 11:12:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-04-08 11:12:39,141 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 101 [2022-04-08 11:12:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:39,141 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-04-08 11:12:39,141 INFO L479 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-08 11:12:39,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 122 transitions. [2022-04-08 11:12:39,335 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-08 11:12:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-04-08 11:12:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-08 11:12:39,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:39,337 INFO L499 BasicCegarLoop]: 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-08 11:12:39,344 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-08 11:12:39,542 WARN L460 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-08 11:12:39,542 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 3 times [2022-04-08 11:12:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:39,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2056156126] [2022-04-08 11:12:39,795 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:39,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 4 times [2022-04-08 11:12:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:39,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463766451] [2022-04-08 11:12:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:39,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:39,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071877772] [2022-04-08 11:12:39,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:39,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:39,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:39,807 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-08 11:12:39,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