/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-fb4f59a-m [2022-04-28 11:13:38,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:13:38,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:13:38,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:13:38,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:13:38,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:13:38,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:13:38,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:13:38,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:13:38,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:13:38,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:13:38,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:13:38,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:13:38,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:13:38,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:13:38,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:13:38,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:13:38,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:13:38,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:13:38,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:13:38,148 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:13:38,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:13:38,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:13:38,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:13:38,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:13:38,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:13:38,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:13:38,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:13:38,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:13:38,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:13:38,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:13:38,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:13:38,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:13:38,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:13:38,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:13:38,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:13:38,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:13:38,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:13:38,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:13:38,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:13:38,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:13:38,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:13:38,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:13:38,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:13:38,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:13:38,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:13:38,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:13:38,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:13:38,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:13:38,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:13:38,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:13:38,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:13:38,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:13:38,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:13:38,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:13:38,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:13:38,173 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:13:38,174 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 11:13:38,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:13:38,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:13:38,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:13:38,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:13:38,376 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:13:38,376 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-28 11:13:38,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671fea390/bff4bddcbb9c479386f0f17e6f035bb9/FLAGb3bcb8d7f [2022-04-28 11:13:38,779 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:13:38,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-28 11:13:38,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671fea390/bff4bddcbb9c479386f0f17e6f035bb9/FLAGb3bcb8d7f [2022-04-28 11:13:38,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671fea390/bff4bddcbb9c479386f0f17e6f035bb9 [2022-04-28 11:13:38,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:13:38,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:13:38,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:13:38,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:13:38,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:13:38,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:13:38" (1/1) ... [2022-04-28 11:13:38,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4379cb14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:38, skipping insertion in model container [2022-04-28 11:13:38,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:13:38" (1/1) ... [2022-04-28 11:13:38,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:13:38,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:13:38,946 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-28 11:13:38,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:13:38,969 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:13:38,978 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-28 11:13:38,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:13:39,005 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:13:39,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39 WrapperNode [2022-04-28 11:13:39,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:13:39,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:13:39,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:13:39,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:13:39,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (1/1) ... [2022-04-28 11:13:39,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (1/1) ... [2022-04-28 11:13:39,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (1/1) ... [2022-04-28 11:13:39,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (1/1) ... [2022-04-28 11:13:39,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (1/1) ... [2022-04-28 11:13:39,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (1/1) ... [2022-04-28 11:13:39,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (1/1) ... [2022-04-28 11:13:39,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:13:39,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:13:39,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:13:39,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:13:39,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (1/1) ... [2022-04-28 11:13:39,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:13:39,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:39,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 11:13:39,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:13:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:13:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:13:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:13:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:13:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:13:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:13:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:13:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:13:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:13:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:13:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:13:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:13:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:13:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:13:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:13:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:13:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:13:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:13:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:13:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:13:39,146 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:13:39,147 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:13:39,275 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:13:39,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:13:39,281 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:13:39,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:13:39 BoogieIcfgContainer [2022-04-28 11:13:39,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:13:39,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:13:39,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:13:39,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:13:39,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:13:38" (1/3) ... [2022-04-28 11:13:39,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2607b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:13:39, skipping insertion in model container [2022-04-28 11:13:39,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:39" (2/3) ... [2022-04-28 11:13:39,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2607b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:13:39, skipping insertion in model container [2022-04-28 11:13:39,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:13:39" (3/3) ... [2022-04-28 11:13:39,289 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2022-04-28 11:13:39,300 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:13:39,300 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:13:39,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:13:39,340 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34243d4c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@726382d8 [2022-04-28 11:13:39,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:13:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 11:13:39,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:39,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:39,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-28 11:13:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:39,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106986203] [2022-04-28 11:13:39,370 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-28 11:13:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:39,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784983595] [2022-04-28 11:13:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:39,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 11:13:39,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:13:39,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:13:39,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:39,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 11:13:39,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:13:39,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:13:39,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-28 11:13:39,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-28 11:13:39,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 11:13:39,525 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-28 11:13:39,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 11:13:39,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 11:13:39,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 11:13:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:13:39,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:39,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784983595] [2022-04-28 11:13:39,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784983595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:39,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:39,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:13:39,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:39,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106986203] [2022-04-28 11:13:39,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106986203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:39,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:39,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:13:39,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253672582] [2022-04-28 11:13:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:39,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 11:13:39,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:39,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:39,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:39,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:13:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:39,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:13:39,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:13:39,573 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:39,772 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-28 11:13:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:13:39,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 11:13:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:13:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:13:39,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 11:13:39,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:39,913 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:13:39,913 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 11:13:39,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:13:39,918 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:39,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 11:13:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 11:13:39,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:39,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:39,945 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:39,945 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:39,949 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:13:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:13:39,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:39,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:39,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-28 11:13:39,951 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-28 11:13:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:39,954 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:13:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:13:39,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:39,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:39,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:39,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-28 11:13:39,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-28 11:13:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:39,959 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-28 11:13:39,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:39,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-28 11:13:39,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-28 11:13:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:13:39,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:39,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:39,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:13:39,997 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-28 11:13:39,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:39,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1807067811] [2022-04-28 11:13:39,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-28 11:13:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:39,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16750396] [2022-04-28 11:13:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:40,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:40,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:40,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:40,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:40,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:40,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:40,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:40,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:40,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:40,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-28 11:13:40,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {263#false} is VALID [2022-04-28 11:13:40,067 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-28 11:13:40,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 11:13:40,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 11:13:40,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 11:13:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:13:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:40,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16750396] [2022-04-28 11:13:40,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16750396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:40,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:40,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:13:40,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:40,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1807067811] [2022-04-28 11:13:40,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1807067811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:40,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:40,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:13:40,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105293549] [2022-04-28 11:13:40,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:40,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:40,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:40,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:40,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:40,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:40,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:40,080 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,229 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-28 11:13:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:13:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:13:43,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-28 11:13:43,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:43,300 INFO L225 Difference]: With dead ends: 40 [2022-04-28 11:13:43,300 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 11:13:43,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:43,302 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:43,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 11:13:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 11:13:43,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:43,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:43,308 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:43,308 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,310 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:13:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:43,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:43,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:43,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-28 11:13:43,311 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-28 11:13:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,313 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:13:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:43,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:43,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:43,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:43,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 11:13:43,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-28 11:13:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:43,317 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 11:13:43,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 11:13:43,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:13:43,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:43,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:43,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:13:43,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:43,353 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-28 11:13:43,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:43,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430698393] [2022-04-28 11:13:43,359 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-28 11:13:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:43,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447331916] [2022-04-28 11:13:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:43,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:43,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-28 11:13:43,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:13:43,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:13:43,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:43,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-28 11:13:43,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:13:43,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:13:43,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-28 11:13:43,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:13:43,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:13:43,504 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-28 11:13:43,506 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:43,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:43,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-28 11:13:43,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-28 11:13:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:13:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:43,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447331916] [2022-04-28 11:13:43,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447331916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:43,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:43,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:43,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:43,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430698393] [2022-04-28 11:13:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430698393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:43,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:43,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978682289] [2022-04-28 11:13:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:43,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:43,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:43,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:43,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:43,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:43,525 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,845 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 11:13:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:13:43,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:13:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:13:43,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 11:13:43,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:43,888 INFO L225 Difference]: With dead ends: 34 [2022-04-28 11:13:43,888 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 11:13:43,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:43,889 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:43,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 11:13:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 11:13:43,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:43,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:43,895 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:43,895 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,900 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:13:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:43,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:43,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:43,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 11:13:43,901 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 11:13:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,902 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:13:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:43,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:43,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:43,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:43,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 11:13:43,905 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 11:13:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:43,905 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 11:13:43,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:43,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 11:13:43,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:13:43,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:43,942 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:43,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 11:13:43,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-28 11:13:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:43,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [132531667] [2022-04-28 11:13:43,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-28 11:13:43,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:43,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888493046] [2022-04-28 11:13:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:43,973 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:43,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1129192142] [2022-04-28 11:13:43,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:43,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:43,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:13:43,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 11:13:44,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:44,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:44,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:44,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:44,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-28 11:13:44,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {681#true} is VALID [2022-04-28 11:13:44,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:13:44,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-28 11:13:44,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-28 11:13:44,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:44,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:44,163 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-28 11:13:44,163 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-28 11:13:44,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-28 11:13:44,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-28 11:13:44,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:13:44,171 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:44,172 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:44,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:44,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-28 11:13:44,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-28 11:13:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:13:44,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:44,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888493046] [2022-04-28 11:13:44,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:44,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129192142] [2022-04-28 11:13:44,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129192142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:44,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:44,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:44,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [132531667] [2022-04-28 11:13:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [132531667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:44,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:44,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453313507] [2022-04-28 11:13:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:44,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 11:13:44,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:44,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:44,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:44,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:44,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:44,200 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:46,807 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-28 11:13:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 11:13:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:46,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:46,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:46,868 INFO L225 Difference]: With dead ends: 50 [2022-04-28 11:13:46,868 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 11:13:46,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:46,869 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:46,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 11:13:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-28 11:13:46,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:46,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:46,888 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:46,889 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:46,899 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:13:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:13:46,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:46,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:46,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 11:13:46,904 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 11:13:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:46,906 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:13:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:13:46,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:46,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:46,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:46,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-28 11:13:46,908 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-28 11:13:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:46,908 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-28 11:13:46,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:46,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-28 11:13:46,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-28 11:13:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:13:46,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:46,958 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:46,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:47,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:47,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-28 11:13:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:47,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1647708620] [2022-04-28 11:13:47,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-28 11:13:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:47,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144473599] [2022-04-28 11:13:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:47,181 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:47,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138527802] [2022-04-28 11:13:47,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:47,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:47,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:47,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:13:47,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 11:13:47,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:47,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:47,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:47,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:47,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-28 11:13:47,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1010#true} is VALID [2022-04-28 11:13:47,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:47,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-28 11:13:47,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-28 11:13:47,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:47,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:47,329 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-28 11:13:47,329 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-28 11:13:47,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:13:47,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:13:47,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:47,330 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:47,331 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1010#true} is VALID [2022-04-28 11:13:47,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:13:47,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:13:47,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:47,333 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:47,333 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:47,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:47,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 11:13:47,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 11:13:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:13:47,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144473599] [2022-04-28 11:13:47,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138527802] [2022-04-28 11:13:47,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138527802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:47,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:47,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:47,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1647708620] [2022-04-28 11:13:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1647708620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:47,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:47,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684045774] [2022-04-28 11:13:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:13:47,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:47,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:47,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:47,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:47,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:47,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:47,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:47,353 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:47,558 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:13:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:13:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:47,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:47,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:47,615 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:13:47,615 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:13:47,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:47,616 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:47,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:13:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-28 11:13:47,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:47,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:47,630 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:47,630 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:47,632 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:13:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:13:47,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:47,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:47,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-28 11:13:47,633 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-28 11:13:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:47,635 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:13:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:13:47,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:47,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:47,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:47,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-28 11:13:47,638 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-28 11:13:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:47,638 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-28 11:13:47,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:47,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-28 11:13:47,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-28 11:13:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:13:47,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:47,702 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:47,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:47,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:47,915 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-28 11:13:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:47,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1096366772] [2022-04-28 11:13:47,917 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-28 11:13:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:47,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146530390] [2022-04-28 11:13:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:47,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:47,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:47,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843888060] [2022-04-28 11:13:47,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:47,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:47,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:13:47,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 11:13:47,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:47,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:47,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:13:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:47,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:48,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-28 11:13:48,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#true} is VALID [2022-04-28 11:13:48,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:48,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-28 11:13:48,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-28 11:13:48,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:48,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:48,091 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-28 11:13:48,092 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-28 11:13:48,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:48,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:48,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:48,093 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:48,093 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1390#true} is VALID [2022-04-28 11:13:48,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:48,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:48,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:48,094 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:48,094 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-28 11:13:48,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:48,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:48,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:48,096 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:48,097 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:48,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:48,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-28 11:13:48,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-28 11:13:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:13:48,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:48,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146530390] [2022-04-28 11:13:48,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:48,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843888060] [2022-04-28 11:13:48,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843888060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:48,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:48,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:48,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:48,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1096366772] [2022-04-28 11:13:48,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1096366772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:48,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:48,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:48,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419354343] [2022-04-28 11:13:48,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:13:48,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:48,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:48,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:48,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:48,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:48,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:48,114 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:48,363 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-28 11:13:48,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:13:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:48,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:48,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:48,431 INFO L225 Difference]: With dead ends: 62 [2022-04-28 11:13:48,431 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 11:13:48,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:48,432 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:48,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 11:13:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 11:13:48,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:48,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:48,449 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:48,450 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:48,452 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:13:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:48,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:48,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:48,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-28 11:13:48,453 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-28 11:13:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:48,455 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:13:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:48,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:48,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:48,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:48,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 11:13:48,457 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-28 11:13:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:48,457 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 11:13:48,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:48,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 11:13:48,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:13:48,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:48,516 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:48,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:48,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:48,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:48,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-28 11:13:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:48,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728638371] [2022-04-28 11:13:49,047 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:49,047 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-28 11:13:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:49,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472816320] [2022-04-28 11:13:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:49,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:49,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544479664] [2022-04-28 11:13:49,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:49,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:49,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:49,080 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:13:49,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 11:13:49,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:49,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:49,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:49,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:49,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:13:49,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:49,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:49,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:49,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:49,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:49,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,288 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-28 11:13:49,289 INFO L272 TraceCheckUtils]: 8: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,300 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,301 INFO L272 TraceCheckUtils]: 13: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,302 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,302 INFO L272 TraceCheckUtils]: 18: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,303 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,304 INFO L272 TraceCheckUtils]: 23: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,305 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,306 INFO L272 TraceCheckUtils]: 28: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,307 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {1825#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:49,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {1825#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1910#(<= |main_#t~post5| 1)} is VALID [2022-04-28 11:13:49,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:13:49,308 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:49,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:49,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-28 11:13:49,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-28 11:13:49,308 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:13:49,308 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:49,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:49,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:13:49,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:13:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 11:13:49,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:49,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:13:49,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:13:49,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:49,498 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:49,499 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:13:49,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:49,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:49,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:49,499 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:49,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:13:49,500 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-28 11:13:49,500 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-28 11:13:49,501 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #67#return; {1972#(< ~counter~0 20)} is VALID [2022-04-28 11:13:49,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:49,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:49,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:49,501 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-28 11:13:49,502 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #65#return; {1972#(< ~counter~0 20)} is VALID [2022-04-28 11:13:49,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:49,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:49,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:49,502 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-28 11:13:49,503 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #63#return; {1972#(< ~counter~0 20)} is VALID [2022-04-28 11:13:49,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:49,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:49,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:49,503 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-28 11:13:49,503 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #61#return; {1972#(< ~counter~0 20)} is VALID [2022-04-28 11:13:49,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:49,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:49,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:49,504 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-28 11:13:49,504 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 20)} #59#return; {1972#(< ~counter~0 20)} is VALID [2022-04-28 11:13:49,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:49,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:49,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:49,504 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-28 11:13:49,505 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-28 11:13:49,505 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-28 11:13:49,505 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-28 11:13:49,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 19)} call #t~ret6 := main(); {2057#(< ~counter~0 19)} is VALID [2022-04-28 11:13:49,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 19)} {1801#true} #81#return; {2057#(< ~counter~0 19)} is VALID [2022-04-28 11:13:49,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 19)} assume true; {2057#(< ~counter~0 19)} is VALID [2022-04-28 11:13:49,507 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-28 11:13:49,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:13:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:49,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472816320] [2022-04-28 11:13:49,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:49,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544479664] [2022-04-28 11:13:49,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544479664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:49,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:49,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 11:13:49,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728638371] [2022-04-28 11:13:49,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728638371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:49,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:49,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792462022] [2022-04-28 11:13:49,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:49,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:49,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:49,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:49,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:49,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:49,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:49,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:49,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:13:49,530 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:49,809 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-28 11:13:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:49,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:13:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:13:49,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-28 11:13:49,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:49,855 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:13:49,855 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:13:49,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:13:49,856 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:49,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:13:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 11:13:49,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:49,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:49,883 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:49,883 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:49,885 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:13:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:49,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:49,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:49,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:13:49,885 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:13:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:49,887 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:13:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:49,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:49,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:49,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:49,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 11:13:49,889 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-28 11:13:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:49,889 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 11:13:49,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:49,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 11:13:49,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:13:49,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:49,959 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:49,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:50,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:50,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-28 11:13:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [308125323] [2022-04-28 11:13:50,479 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:50,479 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-28 11:13:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:50,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996770998] [2022-04-28 11:13:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:50,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:50,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743431238] [2022-04-28 11:13:50,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:50,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:50,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:50,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:13:50,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 11:13:50,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:50,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:50,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:13:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:50,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:50,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:13:50,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2448#true} is VALID [2022-04-28 11:13:50,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:13:50,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:13:50,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:50,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:50,702 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-28 11:13:50,702 INFO L272 TraceCheckUtils]: 8: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,703 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:50,703 INFO L272 TraceCheckUtils]: 13: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,703 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:50,703 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,704 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:50,704 INFO L272 TraceCheckUtils]: 23: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,705 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:50,705 INFO L272 TraceCheckUtils]: 28: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,706 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:50,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:50,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:50,707 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-28 11:13:50,707 INFO L272 TraceCheckUtils]: 36: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,708 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:50,708 INFO L272 TraceCheckUtils]: 41: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:50,709 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:50,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:13:50,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:13:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:50,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:50,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:13:50,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:13:50,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:50,908 INFO L272 TraceCheckUtils]: 41: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:50,909 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:50,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,909 INFO L272 TraceCheckUtils]: 36: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,910 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-28 11:13:50,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:50,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:50,917 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #67#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:50,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,917 INFO L272 TraceCheckUtils]: 28: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,918 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #65#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:50,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,918 INFO L272 TraceCheckUtils]: 23: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,919 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #63#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:50,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,919 INFO L272 TraceCheckUtils]: 18: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,919 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #61#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:50,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,920 INFO L272 TraceCheckUtils]: 13: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,920 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #59#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:50,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:50,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:50,920 INFO L272 TraceCheckUtils]: 8: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:50,921 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-28 11:13:50,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:50,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:50,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:13:50,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:13:50,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:50,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2448#true} is VALID [2022-04-28 11:13:50,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:13:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996770998] [2022-04-28 11:13:50,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743431238] [2022-04-28 11:13:50,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743431238] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:50,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:50,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:13:50,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:50,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [308125323] [2022-04-28 11:13:50,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [308125323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:50,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:50,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132468291] [2022-04-28 11:13:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:50,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:50,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:50,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:50,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:50,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:50,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:13:50,947 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,340 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-28 11:13:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:51,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:13:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:13:51,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-28 11:13:51,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:51,402 INFO L225 Difference]: With dead ends: 78 [2022-04-28 11:13:51,403 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 11:13:51,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:13:51,403 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:51,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 11:13:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-28 11:13:51,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:51,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:51,438 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:51,438 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,441 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:13:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:13:51,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:51,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:51,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:13:51,441 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:13:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,443 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:13:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:13:51,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:51,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:51,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:51,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-28 11:13:51,445 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-28 11:13:51,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:51,445 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-28 11:13:51,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:51,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-28 11:13:51,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 11:13:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:13:51,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:51,511 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:51,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:51,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:51,715 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:51,716 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-28 11:13:51,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:51,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190978197] [2022-04-28 11:13:51,974 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:51,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-28 11:13:51,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:51,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617168261] [2022-04-28 11:13:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:51,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:51,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834688314] [2022-04-28 11:13:51,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:51,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:51,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:13:51,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 11:13:52,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:52,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:52,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:13:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:52,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:52,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:13:52,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#true} is VALID [2022-04-28 11:13:52,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:13:52,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:13:52,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 20);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:52,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,346 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #61#return; {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:52,346 INFO L272 TraceCheckUtils]: 18: Hoare triple {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:52,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,347 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,347 INFO L272 TraceCheckUtils]: 23: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:52,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:52,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,348 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3167#true} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,348 INFO L272 TraceCheckUtils]: 28: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:52,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:52,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,349 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:13:52,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-28 11:13:52,358 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-28 11:13:52,358 INFO L272 TraceCheckUtils]: 36: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:52,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,362 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,362 INFO L272 TraceCheckUtils]: 41: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:52,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,364 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:13:52,364 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:52,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:52,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:13:52,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:13:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 11:13:52,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:52,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:13:52,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:13:52,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:52,882 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:52,883 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:13:52,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:52,884 INFO L272 TraceCheckUtils]: 41: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,885 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:52,886 INFO L272 TraceCheckUtils]: 36: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,886 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-28 11:13:52,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,893 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:52,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:52,893 INFO L272 TraceCheckUtils]: 28: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,894 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3167#true} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:52,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:52,894 INFO L272 TraceCheckUtils]: 23: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,895 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #63#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:13:52,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:52,896 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:52,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 20);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:13:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 11:13:52,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:52,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617168261] [2022-04-28 11:13:52,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:52,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834688314] [2022-04-28 11:13:52,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834688314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:52,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:52,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:13:52,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:52,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190978197] [2022-04-28 11:13:52,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190978197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:52,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:52,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:13:52,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598079795] [2022-04-28 11:13:52,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:52,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:13:52,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:52,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:52,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:52,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:13:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:13:52,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:13:52,935 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:56,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:59,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:59,413 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-04-28 11:13:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:13:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:13:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:13:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:13:59,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 11:14:00,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:00,967 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:14:00,967 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 11:14:00,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:14:00,968 INFO L413 NwaCegarLoop]: 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-28 11:14:00,968 INFO L414 NwaCegarLoop]: 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-28 11:14:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 11:14:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 11:14:01,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:01,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:14:01,014 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:14:01,014 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:14:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:01,023 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-28 11:14:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:14:01,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:01,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:01,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-04-28 11:14:01,024 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-04-28 11:14:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:01,026 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-28 11:14:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:14:01,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:01,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:01,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:01,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:14:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-28 11:14:01,028 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 50 [2022-04-28 11:14:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:01,028 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-28 11:14:01,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:01,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-28 11:14:03,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:14:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 11:14:03,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:03,172 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:03,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:03,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:03,373 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:03,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-28 11:14:03,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:03,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950718169] [2022-04-28 11:14:03,625 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:03,625 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:03,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-28 11:14:03,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:03,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349579053] [2022-04-28 11:14:03,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:03,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:03,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:03,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730083805] [2022-04-28 11:14:03,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:03,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:03,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:03,634 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:03,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 11:14:03,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:03,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:03,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:14:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:03,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:04,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {3898#true} call ULTIMATE.init(); {3898#true} is VALID [2022-04-28 11:14:04,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {3898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3898#true} is VALID [2022-04-28 11:14:04,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3898#true} {3898#true} #81#return; {3898#true} is VALID [2022-04-28 11:14:04,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {3898#true} call #t~ret6 := main(); {3898#true} is VALID [2022-04-28 11:14:04,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {3898#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:04,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:04,140 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-28 11:14:04,140 INFO L272 TraceCheckUtils]: 8: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,141 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:04,141 INFO L272 TraceCheckUtils]: 13: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,142 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:04,142 INFO L272 TraceCheckUtils]: 18: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,142 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:04,143 INFO L272 TraceCheckUtils]: 23: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,143 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:04,143 INFO L272 TraceCheckUtils]: 28: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,144 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:04,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:04,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:04,145 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-28 11:14:04,145 INFO L272 TraceCheckUtils]: 36: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,146 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #59#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:04,146 INFO L272 TraceCheckUtils]: 41: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,146 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #61#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:04,147 INFO L272 TraceCheckUtils]: 46: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,147 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #63#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:04,147 INFO L272 TraceCheckUtils]: 51: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,148 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #65#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:04,148 INFO L272 TraceCheckUtils]: 56: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,149 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #67#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:04,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:04,149 INFO L272 TraceCheckUtils]: 62: Hoare triple {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-28 11:14:04,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-28 11:14:04,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-28 11:14:04,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-28 11:14:04,150 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3898#true} {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:04,150 INFO L272 TraceCheckUtils]: 67: Hoare triple {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:04,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {4107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:04,151 INFO L290 TraceCheckUtils]: 69: Hoare triple {4111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3899#false} is VALID [2022-04-28 11:14:04,151 INFO L290 TraceCheckUtils]: 70: Hoare triple {3899#false} assume !false; {3899#false} is VALID [2022-04-28 11:14:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:04,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:04,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:04,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349579053] [2022-04-28 11:14:04,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:04,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730083805] [2022-04-28 11:14:04,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730083805] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:04,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:04,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:04,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:04,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950718169] [2022-04-28 11:14:04,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950718169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:04,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:04,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341063388] [2022-04-28 11:14:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:04,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:14:04,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:04,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:04,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:04,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:04,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:04,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:04,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:04,517 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:04,952 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-04-28 11:14:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:04,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:14:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:14:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:14:04,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-28 11:14:05,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:05,025 INFO L225 Difference]: With dead ends: 84 [2022-04-28 11:14:05,025 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 11:14:05,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:05,026 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:05,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 11:14:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-28 11:14:05,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:05,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:05,110 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:05,111 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:05,118 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-28 11:14:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-28 11:14:05,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:05,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:05,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 82 states. [2022-04-28 11:14:05,119 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 82 states. [2022-04-28 11:14:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:05,122 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-28 11:14:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-28 11:14:05,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:05,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:05,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:05,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-04-28 11:14:05,125 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 71 [2022-04-28 11:14:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:05,126 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-04-28 11:14:05,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:05,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 92 transitions. [2022-04-28 11:14:05,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-28 11:14:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 11:14:05,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:05,268 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:05,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:05,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:05,469 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:05,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-28 11:14:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:05,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1366180193] [2022-04-28 11:14:05,737 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:05,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-28 11:14:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:05,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29223073] [2022-04-28 11:14:05,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:05,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:05,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:05,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158031955] [2022-04-28 11:14:05,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:05,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:05,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:05,748 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:05,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 11:14:05,789 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:05,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:05,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:14:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:05,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:06,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2022-04-28 11:14:06,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {4735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:06,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {4743#(<= ~counter~0 0)} assume true; {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:06,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4743#(<= ~counter~0 0)} {4735#true} #81#return; {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:06,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {4743#(<= ~counter~0 0)} call #t~ret6 := main(); {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:06,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {4743#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4743#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:06,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {4743#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,097 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-28 11:14:06,097 INFO L272 TraceCheckUtils]: 8: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,098 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #59#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,099 INFO L272 TraceCheckUtils]: 13: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,100 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #61#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,100 INFO L272 TraceCheckUtils]: 18: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,101 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #63#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,102 INFO L272 TraceCheckUtils]: 23: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,103 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #65#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,103 INFO L272 TraceCheckUtils]: 28: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,104 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #67#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {4759#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4759#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:06,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {4759#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,105 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-28 11:14:06,106 INFO L272 TraceCheckUtils]: 36: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,107 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #59#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,107 INFO L272 TraceCheckUtils]: 41: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,111 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #61#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,111 INFO L272 TraceCheckUtils]: 46: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,112 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #63#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,112 INFO L272 TraceCheckUtils]: 51: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,114 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #65#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,114 INFO L272 TraceCheckUtils]: 56: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,115 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #67#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {4844#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4844#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:06,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {4844#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4929#(<= |main_#t~post5| 2)} is VALID [2022-04-28 11:14:06,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {4929#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {4736#false} is VALID [2022-04-28 11:14:06,116 INFO L272 TraceCheckUtils]: 64: Hoare triple {4736#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4736#false} is VALID [2022-04-28 11:14:06,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-28 11:14:06,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {4736#false} assume !(0 == ~cond); {4736#false} is VALID [2022-04-28 11:14:06,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {4736#false} assume true; {4736#false} is VALID [2022-04-28 11:14:06,117 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4736#false} {4736#false} #69#return; {4736#false} is VALID [2022-04-28 11:14:06,117 INFO L272 TraceCheckUtils]: 69: Hoare triple {4736#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4736#false} is VALID [2022-04-28 11:14:06,117 INFO L290 TraceCheckUtils]: 70: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-28 11:14:06,117 INFO L290 TraceCheckUtils]: 71: Hoare triple {4736#false} assume 0 == ~cond; {4736#false} is VALID [2022-04-28 11:14:06,117 INFO L290 TraceCheckUtils]: 72: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2022-04-28 11:14:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 60 proven. 112 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-28 11:14:06,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:06,368 INFO L290 TraceCheckUtils]: 72: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2022-04-28 11:14:06,368 INFO L290 TraceCheckUtils]: 71: Hoare triple {4736#false} assume 0 == ~cond; {4736#false} is VALID [2022-04-28 11:14:06,368 INFO L290 TraceCheckUtils]: 70: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-28 11:14:06,368 INFO L272 TraceCheckUtils]: 69: Hoare triple {4736#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4736#false} is VALID [2022-04-28 11:14:06,368 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4735#true} {4736#false} #69#return; {4736#false} is VALID [2022-04-28 11:14:06,369 INFO L290 TraceCheckUtils]: 67: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,369 INFO L272 TraceCheckUtils]: 64: Hoare triple {4736#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-28 11:14:06,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {4987#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4736#false} is VALID [2022-04-28 11:14:06,369 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-28 11:14:06,369 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-28 11:14:06,370 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #67#return; {4991#(< ~counter~0 20)} is VALID [2022-04-28 11:14:06,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,370 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-28 11:14:06,371 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #65#return; {4991#(< ~counter~0 20)} is VALID [2022-04-28 11:14:06,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,371 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-28 11:14:06,371 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #63#return; {4991#(< ~counter~0 20)} is VALID [2022-04-28 11:14:06,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,371 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-28 11:14:06,372 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #61#return; {4991#(< ~counter~0 20)} is VALID [2022-04-28 11:14:06,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,372 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-28 11:14:06,372 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4735#true} {4991#(< ~counter~0 20)} #59#return; {4991#(< ~counter~0 20)} is VALID [2022-04-28 11:14:06,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,373 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-28 11:14:06,373 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-28 11:14:06,373 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-28 11:14:06,374 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-28 11:14:06,374 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #67#return; {5076#(< ~counter~0 19)} is VALID [2022-04-28 11:14:06,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,374 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-28 11:14:06,375 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #65#return; {5076#(< ~counter~0 19)} is VALID [2022-04-28 11:14:06,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,375 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-28 11:14:06,375 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #63#return; {5076#(< ~counter~0 19)} is VALID [2022-04-28 11:14:06,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,376 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-28 11:14:06,376 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #61#return; {5076#(< ~counter~0 19)} is VALID [2022-04-28 11:14:06,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,376 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-28 11:14:06,377 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4735#true} {5076#(< ~counter~0 19)} #59#return; {5076#(< ~counter~0 19)} is VALID [2022-04-28 11:14:06,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-28 11:14:06,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-28 11:14:06,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-28 11:14:06,377 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-28 11:14:06,377 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-28 11:14:06,377 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-28 11:14:06,378 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-28 11:14:06,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#(< ~counter~0 18)} call #t~ret6 := main(); {5161#(< ~counter~0 18)} is VALID [2022-04-28 11:14:06,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#(< ~counter~0 18)} {4735#true} #81#return; {5161#(< ~counter~0 18)} is VALID [2022-04-28 11:14:06,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#(< ~counter~0 18)} assume true; {5161#(< ~counter~0 18)} is VALID [2022-04-28 11:14:06,379 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-28 11:14:06,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2022-04-28 11:14:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:06,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29223073] [2022-04-28 11:14:06,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:06,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158031955] [2022-04-28 11:14:06,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158031955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:06,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:06,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:14:06,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:06,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1366180193] [2022-04-28 11:14:06,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1366180193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:06,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:06,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:06,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751787167] [2022-04-28 11:14:06,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:06,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-28 11:14:06,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:06,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:06,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:06,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:06,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:06,420 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:06,853 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-28 11:14:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:14:06,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-28 11:14:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 11:14:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 11:14:06,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 11:14:06,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:06,913 INFO L225 Difference]: With dead ends: 111 [2022-04-28 11:14:06,913 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:14:06,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:06,914 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:06,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:14:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-28 11:14:07,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:07,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:07,017 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:07,017 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:07,019 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:14:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:14:07,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:07,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:07,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 96 states. [2022-04-28 11:14:07,019 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 96 states. [2022-04-28 11:14:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:07,021 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:14:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:14:07,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:07,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:07,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:07,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-04-28 11:14:07,023 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 73 [2022-04-28 11:14:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:07,023 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-04-28 11:14:07,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:07,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 103 transitions. [2022-04-28 11:14:07,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-04-28 11:14:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:14:07,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:07,149 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:07,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:07,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 11:14:07,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-28 11:14:07,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:07,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200433249] [2022-04-28 11:14:07,636 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:07,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-28 11:14:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:07,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968297289] [2022-04-28 11:14:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:07,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:07,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:07,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206160443] [2022-04-28 11:14:07,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:07,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:07,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:07,664 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:07,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 11:14:07,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:07,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:07,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:14:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:07,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:08,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {5788#true} call ULTIMATE.init(); {5788#true} is VALID [2022-04-28 11:14:08,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {5788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5788#true} is VALID [2022-04-28 11:14:08,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5788#true} {5788#true} #81#return; {5788#true} is VALID [2022-04-28 11:14:08,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {5788#true} call #t~ret6 := main(); {5788#true} is VALID [2022-04-28 11:14:08,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {5788#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:08,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:08,295 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-28 11:14:08,295 INFO L272 TraceCheckUtils]: 8: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,296 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:08,296 INFO L272 TraceCheckUtils]: 13: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,297 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:08,297 INFO L272 TraceCheckUtils]: 18: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,297 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:08,297 INFO L272 TraceCheckUtils]: 23: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,298 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:08,298 INFO L272 TraceCheckUtils]: 28: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,299 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:08,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:08,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:08,300 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-28 11:14:08,300 INFO L272 TraceCheckUtils]: 36: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,301 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:08,301 INFO L272 TraceCheckUtils]: 41: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,302 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:08,302 INFO L272 TraceCheckUtils]: 46: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,302 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:08,302 INFO L272 TraceCheckUtils]: 51: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,310 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:08,310 INFO L272 TraceCheckUtils]: 56: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,310 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:08,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:08,311 INFO L272 TraceCheckUtils]: 62: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,311 INFO L290 TraceCheckUtils]: 63: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,311 INFO L290 TraceCheckUtils]: 64: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,311 INFO L290 TraceCheckUtils]: 65: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,311 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5788#true} {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:08,311 INFO L272 TraceCheckUtils]: 67: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5788#true} is VALID [2022-04-28 11:14:08,312 INFO L290 TraceCheckUtils]: 68: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-28 11:14:08,312 INFO L290 TraceCheckUtils]: 69: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-28 11:14:08,312 INFO L290 TraceCheckUtils]: 70: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-28 11:14:08,312 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5788#true} {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:08,313 INFO L272 TraceCheckUtils]: 72: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:08,313 INFO L290 TraceCheckUtils]: 73: Hoare triple {6012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:08,314 INFO L290 TraceCheckUtils]: 74: Hoare triple {6016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5789#false} is VALID [2022-04-28 11:14:08,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {5789#false} assume !false; {5789#false} is VALID [2022-04-28 11:14:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:14:08,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:17,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:17,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968297289] [2022-04-28 11:14:17,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:17,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206160443] [2022-04-28 11:14:17,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206160443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:17,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:17,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:17,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:17,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200433249] [2022-04-28 11:14:17,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200433249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:17,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:17,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:17,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140764475] [2022-04-28 11:14:17,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:17,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:17,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:17,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:17,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:17,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:17,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:17,160 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:17,586 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:14:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:14:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:14:17,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-28 11:14:17,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:17,644 INFO L225 Difference]: With dead ends: 96 [2022-04-28 11:14:17,644 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 11:14:17,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:17,645 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:17,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 11:14:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 11:14:17,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:17,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:17,716 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:17,716 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:17,718 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-28 11:14:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:14:17,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:17,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:17,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 85 states. [2022-04-28 11:14:17,719 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 85 states. [2022-04-28 11:14:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:17,720 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-28 11:14:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:14:17,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:17,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:17,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:17,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:14:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-04-28 11:14:17,722 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 76 [2022-04-28 11:14:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:17,722 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-04-28 11:14:17,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:17,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 92 transitions. [2022-04-28 11:14:19,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:14:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 11:14:19,254 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:19,254 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:19,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:19,463 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-28 11:14:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:19,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2051341153] [2022-04-28 11:14:19,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:19,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-28 11:14:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:19,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848004734] [2022-04-28 11:14:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:19,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502956663] [2022-04-28 11:14:19,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:19,761 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:19,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:14:19,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:19,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:19,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:14:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:19,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:20,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {6693#true} call ULTIMATE.init(); {6693#true} is VALID [2022-04-28 11:14:20,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {6693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6693#true} is VALID [2022-04-28 11:14:20,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6693#true} {6693#true} #81#return; {6693#true} is VALID [2022-04-28 11:14:20,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {6693#true} call #t~ret6 := main(); {6693#true} is VALID [2022-04-28 11:14:20,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {6693#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:20,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:20,435 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-28 11:14:20,435 INFO L272 TraceCheckUtils]: 8: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,435 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:20,435 INFO L272 TraceCheckUtils]: 13: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,436 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:20,436 INFO L272 TraceCheckUtils]: 18: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,437 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:20,437 INFO L272 TraceCheckUtils]: 23: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,438 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:20,438 INFO L272 TraceCheckUtils]: 28: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,441 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:20,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:20,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:20,448 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-28 11:14:20,448 INFO L272 TraceCheckUtils]: 36: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,449 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #59#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:20,449 INFO L272 TraceCheckUtils]: 41: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,450 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #61#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:20,450 INFO L272 TraceCheckUtils]: 46: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,450 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #63#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:20,451 INFO L272 TraceCheckUtils]: 51: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {6693#true} ~cond := #in~cond; {6856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:20,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {6856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:20,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:20,452 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #65#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:20,452 INFO L272 TraceCheckUtils]: 56: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,452 INFO L290 TraceCheckUtils]: 58: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,452 INFO L290 TraceCheckUtils]: 59: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,453 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #67#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:14:20,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:20,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:20,454 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-28 11:14:20,454 INFO L272 TraceCheckUtils]: 64: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,455 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #59#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:20,455 INFO L272 TraceCheckUtils]: 69: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,455 INFO L290 TraceCheckUtils]: 72: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,456 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #61#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:20,456 INFO L272 TraceCheckUtils]: 74: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,456 INFO L290 TraceCheckUtils]: 75: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,457 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #63#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:20,457 INFO L272 TraceCheckUtils]: 79: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,457 INFO L290 TraceCheckUtils]: 80: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,457 INFO L290 TraceCheckUtils]: 81: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,457 INFO L290 TraceCheckUtils]: 82: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,457 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #65#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:20,457 INFO L272 TraceCheckUtils]: 84: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,457 INFO L290 TraceCheckUtils]: 85: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,458 INFO L290 TraceCheckUtils]: 86: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,458 INFO L290 TraceCheckUtils]: 87: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,458 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #67#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:14:20,459 INFO L290 TraceCheckUtils]: 89: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !(~n~0 <= ~a~0); {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-28 11:14:20,459 INFO L272 TraceCheckUtils]: 90: Hoare triple {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-28 11:14:20,459 INFO L290 TraceCheckUtils]: 91: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-28 11:14:20,459 INFO L290 TraceCheckUtils]: 92: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-28 11:14:20,459 INFO L290 TraceCheckUtils]: 93: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-28 11:14:20,460 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6693#true} {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} #69#return; {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-28 11:14:20,460 INFO L272 TraceCheckUtils]: 95: Hoare triple {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6989#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:20,461 INFO L290 TraceCheckUtils]: 96: Hoare triple {6989#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6993#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:20,461 INFO L290 TraceCheckUtils]: 97: Hoare triple {6993#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6694#false} is VALID [2022-04-28 11:14:20,461 INFO L290 TraceCheckUtils]: 98: Hoare triple {6694#false} assume !false; {6694#false} is VALID [2022-04-28 11:14:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 55 proven. 46 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-28 11:14:20,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:20,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848004734] [2022-04-28 11:14:20,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:20,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502956663] [2022-04-28 11:14:20,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502956663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:20,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:20,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 11:14:20,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:20,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2051341153] [2022-04-28 11:14:20,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2051341153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:20,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:20,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:14:20,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457608304] [2022-04-28 11:14:20,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:20,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-28 11:14:20,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:20,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:20,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:20,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:14:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:14:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:14:20,823 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:22,167 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-28 11:14:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:14:22,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-28 11:14:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 11:14:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 11:14:22,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-28 11:14:22,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:22,251 INFO L225 Difference]: With dead ends: 100 [2022-04-28 11:14:22,251 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 11:14:22,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:14:22,251 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:22,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:14:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 11:14:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-28 11:14:22,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:22,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:22,335 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:22,335 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:22,337 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-28 11:14:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-28 11:14:22,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:22,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:22,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 98 states. [2022-04-28 11:14:22,338 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 98 states. [2022-04-28 11:14:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:22,340 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-28 11:14:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-28 11:14:22,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:22,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:22,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:22,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-04-28 11:14:22,343 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 99 [2022-04-28 11:14:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:22,343 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-04-28 11:14:22,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:22,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 111 transitions. [2022-04-28 11:14:24,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 110 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-28 11:14:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 11:14:24,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:24,501 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:24,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:24,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:14:24,701 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-28 11:14:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:24,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [784080950] [2022-04-28 11:14:24,935 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:24,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-28 11:14:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:24,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652951061] [2022-04-28 11:14:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:24,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:24,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597593575] [2022-04-28 11:14:24,944 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:14:24,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:24,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:24,945 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:24,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 11:14:25,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:14:25,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:25,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:14:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:25,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:25,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2022-04-28 11:14:25,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#(<= ~counter~0 0)} assume true; {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#(<= ~counter~0 0)} {7715#true} #81#return; {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {7723#(<= ~counter~0 0)} call #t~ret6 := main(); {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7723#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:25,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {7723#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,527 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-28 11:14:25,528 INFO L272 TraceCheckUtils]: 8: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,529 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #59#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,529 INFO L272 TraceCheckUtils]: 13: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,531 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #61#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,531 INFO L272 TraceCheckUtils]: 18: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,532 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #63#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,533 INFO L272 TraceCheckUtils]: 23: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,534 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #65#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,535 INFO L272 TraceCheckUtils]: 28: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,536 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #67#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {7739#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7739#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:25,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {7739#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,537 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-28 11:14:25,538 INFO L272 TraceCheckUtils]: 36: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,539 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #59#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,539 INFO L272 TraceCheckUtils]: 41: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,540 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #61#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,541 INFO L272 TraceCheckUtils]: 46: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,542 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #63#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,556 INFO L272 TraceCheckUtils]: 51: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,557 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #65#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,558 INFO L272 TraceCheckUtils]: 56: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,559 INFO L290 TraceCheckUtils]: 59: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,560 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #67#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {7824#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7824#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:25,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {7824#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,561 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-28 11:14:25,562 INFO L272 TraceCheckUtils]: 64: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,562 INFO L290 TraceCheckUtils]: 65: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,563 INFO L290 TraceCheckUtils]: 66: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,563 INFO L290 TraceCheckUtils]: 67: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,564 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #59#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,564 INFO L272 TraceCheckUtils]: 69: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,565 INFO L290 TraceCheckUtils]: 70: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,566 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #61#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,567 INFO L272 TraceCheckUtils]: 74: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,567 INFO L290 TraceCheckUtils]: 76: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,568 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #63#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,569 INFO L272 TraceCheckUtils]: 79: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,571 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #65#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,572 INFO L272 TraceCheckUtils]: 84: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,572 INFO L290 TraceCheckUtils]: 85: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,572 INFO L290 TraceCheckUtils]: 86: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,573 INFO L290 TraceCheckUtils]: 87: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,573 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #67#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,574 INFO L290 TraceCheckUtils]: 89: Hoare triple {7909#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7909#(<= ~counter~0 3)} is VALID [2022-04-28 11:14:25,574 INFO L290 TraceCheckUtils]: 90: Hoare triple {7909#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7994#(<= |main_#t~post5| 3)} is VALID [2022-04-28 11:14:25,574 INFO L290 TraceCheckUtils]: 91: Hoare triple {7994#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {7716#false} is VALID [2022-04-28 11:14:25,575 INFO L272 TraceCheckUtils]: 92: Hoare triple {7716#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7716#false} is VALID [2022-04-28 11:14:25,575 INFO L290 TraceCheckUtils]: 93: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-28 11:14:25,575 INFO L290 TraceCheckUtils]: 94: Hoare triple {7716#false} assume !(0 == ~cond); {7716#false} is VALID [2022-04-28 11:14:25,575 INFO L290 TraceCheckUtils]: 95: Hoare triple {7716#false} assume true; {7716#false} is VALID [2022-04-28 11:14:25,575 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7716#false} {7716#false} #69#return; {7716#false} is VALID [2022-04-28 11:14:25,576 INFO L272 TraceCheckUtils]: 97: Hoare triple {7716#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7716#false} is VALID [2022-04-28 11:14:25,576 INFO L290 TraceCheckUtils]: 98: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-28 11:14:25,576 INFO L290 TraceCheckUtils]: 99: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-28 11:14:25,576 INFO L290 TraceCheckUtils]: 100: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-28 11:14:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 90 proven. 330 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-28 11:14:25,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:25,920 INFO L290 TraceCheckUtils]: 100: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-28 11:14:25,920 INFO L290 TraceCheckUtils]: 99: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-28 11:14:25,920 INFO L290 TraceCheckUtils]: 98: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-28 11:14:25,920 INFO L272 TraceCheckUtils]: 97: Hoare triple {7716#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7716#false} is VALID [2022-04-28 11:14:25,921 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7715#true} {7716#false} #69#return; {7716#false} is VALID [2022-04-28 11:14:25,921 INFO L290 TraceCheckUtils]: 95: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,921 INFO L290 TraceCheckUtils]: 94: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,921 INFO L290 TraceCheckUtils]: 93: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,921 INFO L272 TraceCheckUtils]: 92: Hoare triple {7716#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-28 11:14:25,921 INFO L290 TraceCheckUtils]: 91: Hoare triple {8052#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7716#false} is VALID [2022-04-28 11:14:25,921 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-28 11:14:25,922 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-28 11:14:25,922 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #67#return; {8056#(< ~counter~0 20)} is VALID [2022-04-28 11:14:25,922 INFO L290 TraceCheckUtils]: 87: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,922 INFO L290 TraceCheckUtils]: 86: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,922 INFO L290 TraceCheckUtils]: 85: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,922 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-28 11:14:25,923 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #65#return; {8056#(< ~counter~0 20)} is VALID [2022-04-28 11:14:25,923 INFO L290 TraceCheckUtils]: 82: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,923 INFO L290 TraceCheckUtils]: 81: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,923 INFO L290 TraceCheckUtils]: 80: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,923 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-28 11:14:25,923 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #63#return; {8056#(< ~counter~0 20)} is VALID [2022-04-28 11:14:25,924 INFO L290 TraceCheckUtils]: 77: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,924 INFO L290 TraceCheckUtils]: 76: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,924 INFO L290 TraceCheckUtils]: 75: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,924 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-28 11:14:25,924 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #61#return; {8056#(< ~counter~0 20)} is VALID [2022-04-28 11:14:25,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,924 INFO L290 TraceCheckUtils]: 71: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,924 INFO L290 TraceCheckUtils]: 70: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,924 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-28 11:14:25,925 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7715#true} {8056#(< ~counter~0 20)} #59#return; {8056#(< ~counter~0 20)} is VALID [2022-04-28 11:14:25,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,925 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-28 11:14:25,925 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-28 11:14:25,926 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-28 11:14:25,926 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-28 11:14:25,926 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #67#return; {8141#(< ~counter~0 19)} is VALID [2022-04-28 11:14:25,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,927 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-28 11:14:25,927 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #65#return; {8141#(< ~counter~0 19)} is VALID [2022-04-28 11:14:25,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,927 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-28 11:14:25,928 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #63#return; {8141#(< ~counter~0 19)} is VALID [2022-04-28 11:14:25,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,928 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-28 11:14:25,928 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #61#return; {8141#(< ~counter~0 19)} is VALID [2022-04-28 11:14:25,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,929 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-28 11:14:25,929 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7715#true} {8141#(< ~counter~0 19)} #59#return; {8141#(< ~counter~0 19)} is VALID [2022-04-28 11:14:25,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,929 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-28 11:14:25,929 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-28 11:14:25,930 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-28 11:14:25,930 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-28 11:14:25,931 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #67#return; {8226#(< ~counter~0 18)} is VALID [2022-04-28 11:14:25,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,931 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-28 11:14:25,931 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #65#return; {8226#(< ~counter~0 18)} is VALID [2022-04-28 11:14:25,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,932 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-28 11:14:25,932 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #63#return; {8226#(< ~counter~0 18)} is VALID [2022-04-28 11:14:25,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,932 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-28 11:14:25,933 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #61#return; {8226#(< ~counter~0 18)} is VALID [2022-04-28 11:14:25,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,933 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-28 11:14:25,933 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7715#true} {8226#(< ~counter~0 18)} #59#return; {8226#(< ~counter~0 18)} is VALID [2022-04-28 11:14:25,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-28 11:14:25,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-28 11:14:25,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-28 11:14:25,933 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-28 11:14:25,934 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-28 11:14:25,934 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-28 11:14:25,934 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-28 11:14:25,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {8311#(< ~counter~0 17)} call #t~ret6 := main(); {8311#(< ~counter~0 17)} is VALID [2022-04-28 11:14:25,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8311#(< ~counter~0 17)} {7715#true} #81#return; {8311#(< ~counter~0 17)} is VALID [2022-04-28 11:14:25,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {8311#(< ~counter~0 17)} assume true; {8311#(< ~counter~0 17)} is VALID [2022-04-28 11:14:25,936 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-28 11:14:25,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2022-04-28 11:14:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:14:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:25,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652951061] [2022-04-28 11:14:25,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:25,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597593575] [2022-04-28 11:14:25,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597593575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:25,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:25,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 11:14:25,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:25,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [784080950] [2022-04-28 11:14:25,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [784080950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:25,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:25,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410373461] [2022-04-28 11:14:25,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:25,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-28 11:14:25,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:25,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:25,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:25,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:25,984 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:26,494 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-04-28 11:14:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:14:26,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-28 11:14:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:14:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:14:26,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-28 11:14:26,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:26,568 INFO L225 Difference]: With dead ends: 127 [2022-04-28 11:14:26,568 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 11:14:26,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:14:26,569 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:26,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 130 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 11:14:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-04-28 11:14:26,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:26,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:26,679 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:26,679 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:26,681 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-28 11:14:26,681 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-28 11:14:26,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:26,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:26,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 112 states. [2022-04-28 11:14:26,682 INFO L87 Difference]: Start difference. First operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 112 states. [2022-04-28 11:14:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:26,683 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-28 11:14:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-28 11:14:26,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:26,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:26,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:26,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-04-28 11:14:26,686 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 101 [2022-04-28 11:14:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:26,686 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-04-28 11:14:26,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:14:26,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 122 transitions. [2022-04-28 11:14:28,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 121 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-04-28 11:14:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 11:14:28,850 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:28,850 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:28,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:29,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:14:29,052 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:29,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 3 times [2022-04-28 11:14:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:29,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1237910068] [2022-04-28 11:14:29,300 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:29,300 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 4 times [2022-04-28 11:14:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:29,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935223433] [2022-04-28 11:14:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:29,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:29,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956113178] [2022-04-28 11:14:29,308 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:29,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:29,309 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:14:29,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process