/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:12:57,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:12:57,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:12:57,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:12:57,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:12:57,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:12:57,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:12:57,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:12:57,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:12:57,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:12:57,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:12:57,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:12:57,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:12:57,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:12:57,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:12:57,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:12:57,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:12:57,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:12:57,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:12:57,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:12:57,186 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:12:57,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:12:57,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:12:57,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:12:57,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:12:57,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:12:57,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:12:57,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:12:57,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:12:57,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:12:57,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:12:57,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:12:57,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:12:57,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:12:57,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:12:57,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:12:57,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:12:57,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:12:57,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:12:57,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:12:57,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:12:57,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:12:57,196 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:12:57,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:12:57,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:12:57,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:12:57,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:12:57,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:12:57,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:12:57,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:12:57,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:12:57,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:12:57,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:12:57,204 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:12:57,204 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:12:57,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:12:57,204 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:12:57,204 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:12:57,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:12:57,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:12:57,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:12:57,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:12:57,404 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:12:57,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-04-28 11:12:57,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb891ac21/0b9ce43ec6c7449fb8c67fb3a9b6b345/FLAG9ed54a2b9 [2022-04-28 11:12:57,797 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:12:57,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-04-28 11:12:57,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb891ac21/0b9ce43ec6c7449fb8c67fb3a9b6b345/FLAG9ed54a2b9 [2022-04-28 11:12:57,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb891ac21/0b9ce43ec6c7449fb8c67fb3a9b6b345 [2022-04-28 11:12:57,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:12:57,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:12:57,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:12:57,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:12:57,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:12:57,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:12:57" (1/1) ... [2022-04-28 11:12:57,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a41ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:57, skipping insertion in model container [2022-04-28 11:12:57,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:12:57" (1/1) ... [2022-04-28 11:12:57,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:12:57,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:12:57,985 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_unwindbound100.c[588,601] [2022-04-28 11:12:58,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:12:58,018 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:12:58,030 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_unwindbound100.c[588,601] [2022-04-28 11:12:58,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:12:58,058 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:12:58,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58 WrapperNode [2022-04-28 11:12:58,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:12:58,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:12:58,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:12:58,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:12:58,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (1/1) ... [2022-04-28 11:12:58,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (1/1) ... [2022-04-28 11:12:58,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (1/1) ... [2022-04-28 11:12:58,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (1/1) ... [2022-04-28 11:12:58,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (1/1) ... [2022-04-28 11:12:58,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (1/1) ... [2022-04-28 11:12:58,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (1/1) ... [2022-04-28 11:12:58,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:12:58,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:12:58,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:12:58,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:12:58,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (1/1) ... [2022-04-28 11:12:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:12:58,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:12:58,140 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:12:58,145 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:12:58,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:12:58,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:12:58,173 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:12:58,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:12:58,174 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:12:58,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:12:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:12:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:12:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:12:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:12:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:12:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:12:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:12:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:12:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:12:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:12:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:12:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:12:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:12:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:12:58,220 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:12:58,221 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:12:58,388 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:12:58,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:12:58,392 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:12:58,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:12:58 BoogieIcfgContainer [2022-04-28 11:12:58,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:12:58,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:12:58,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:12:58,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:12:58,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:12:57" (1/3) ... [2022-04-28 11:12:58,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7068f2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:12:58, skipping insertion in model container [2022-04-28 11:12:58,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:12:58" (2/3) ... [2022-04-28 11:12:58,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7068f2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:12:58, skipping insertion in model container [2022-04-28 11:12:58,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:12:58" (3/3) ... [2022-04-28 11:12:58,398 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound100.c [2022-04-28 11:12:58,406 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:12:58,407 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:12:58,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:12:58,480 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@dd0ef51, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33aeae73 [2022-04-28 11:12:58,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:12:58,486 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:12:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 11:12:58,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:58,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:58,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-28 11:12:58,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:58,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637268600] [2022-04-28 11:12:58,516 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-28 11:12:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:58,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982204951] [2022-04-28 11:12:58,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:12:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:58,683 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:12:58,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:12:58,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:12:58,685 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:12:58,685 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:12:58,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:12:58,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:12:58,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-28 11:12:58,687 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:12:58,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 11:12:58,687 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:12:58,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 11:12:58,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 11:12:58,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 11:12:58,688 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:12:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:58,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982204951] [2022-04-28 11:12:58,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982204951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:58,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:58,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:12:58,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:58,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637268600] [2022-04-28 11:12:58,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637268600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:58,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:58,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:12:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232196269] [2022-04-28 11:12:58,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:58,696 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:12:58,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:58,699 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:12:58,716 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:12:58,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:12:58,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:12:58,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:12:58,730 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:12:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:58,920 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-28 11:12:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:12:58,920 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:12:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:58,921 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:12:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:12:58,936 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:12:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:12:58,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 11:12:59,041 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:12:59,047 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:12:59,047 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 11:12:59,049 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:12:59,051 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:12:59,052 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:12:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 11:12:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 11:12:59,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:59,071 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:12:59,072 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:12:59,072 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:12:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:59,075 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:12:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:12:59,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:59,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:59,076 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:12:59,077 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:12:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:59,079 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:12:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:12:59,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:59,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:59,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:59,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:59,080 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:12:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-28 11:12:59,083 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-28 11:12:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:59,083 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-28 11:12:59,083 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:12:59,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-28 11:12:59,116 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:12:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-28 11:12:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:12:59,117 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:59,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:59,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:12:59,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-28 11:12:59,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:59,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146615037] [2022-04-28 11:12:59,118 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-28 11:12:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:59,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193828584] [2022-04-28 11:12:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:59,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:59,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:12:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:59,175 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:12:59,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:59,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:59,180 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:12:59,181 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:12:59,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:59,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:59,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-28 11:12:59,183 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:12:59,184 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:12:59,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {263#false} is VALID [2022-04-28 11:12:59,184 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:12:59,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 11:12:59,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 11:12:59,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 11:12:59,185 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:12:59,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:59,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193828584] [2022-04-28 11:12:59,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193828584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:59,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:59,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:12:59,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:59,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146615037] [2022-04-28 11:12:59,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146615037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:59,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:59,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:12:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470605927] [2022-04-28 11:12:59,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:59,187 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:12:59,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:59,188 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:12:59,196 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:12:59,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:12:59,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:12:59,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:12:59,198 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:12:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:59,392 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-28 11:12:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:12:59,393 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:12:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:59,393 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:12:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:12:59,395 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:12:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:12:59,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-28 11:12:59,438 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:12:59,440 INFO L225 Difference]: With dead ends: 40 [2022-04-28 11:12:59,440 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 11:12:59,440 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:12:59,443 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:12:59,443 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:12:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 11:12:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 11:12:59,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:12:59,452 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:12:59,453 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:12:59,453 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:12:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:59,457 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:12:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:12:59,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:59,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:59,463 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:12:59,464 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:12:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:59,465 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:12:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:12:59,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:12:59,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:12:59,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:12:59,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:12:59,466 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:12:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 11:12:59,468 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-28 11:12:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:12:59,468 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 11:12:59,468 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:12:59,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 11:12:59,498 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:12:59,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:12:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:12:59,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:12:59,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:12:59,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:12:59,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:12:59,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:12:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-28 11:12:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:59,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191402901] [2022-04-28 11:12:59,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:12:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-28 11:12:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:12:59,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556131826] [2022-04-28 11:12:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:12:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:12:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:59,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:12:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:12:59,591 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:12:59,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:12:59,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:12:59,592 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:12:59,592 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:12:59,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:12:59,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:12:59,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-28 11:12:59,593 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:12:59,594 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:12:59,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 100);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:12:59,595 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:12:59,596 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:12:59,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-28 11:12:59,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-28 11:12:59,596 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:12:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:12:59,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556131826] [2022-04-28 11:12:59,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556131826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:59,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:59,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:12:59,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:12:59,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191402901] [2022-04-28 11:12:59,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191402901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:12:59,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:12:59,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:12:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183711444] [2022-04-28 11:12:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:12:59,598 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:12:59,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:12:59,599 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:12:59,607 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:12:59,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:12:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:12:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:12:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:12:59,608 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:12:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:12:59,960 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 11:12:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:12:59,961 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:12:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:12:59,961 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:12:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:12:59,963 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:12:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:12:59,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 11:13:00,003 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:00,005 INFO L225 Difference]: With dead ends: 34 [2022-04-28 11:13:00,005 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 11:13:00,005 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:00,006 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:00,007 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:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 11:13:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 11:13:00,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:00,012 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:00,012 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:00,012 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:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:00,014 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:13:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:00,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:00,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:00,015 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:00,015 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:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:00,017 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:13:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:00,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:00,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:00,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:00,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:00,018 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:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 11:13:00,019 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 11:13:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:00,019 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 11:13:00,020 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:00,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 11:13:00,055 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:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:13:00,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:00,056 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:00,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 11:13:00,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:00,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-28 11:13:00,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:00,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312736860] [2022-04-28 11:13:00,058 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-28 11:13:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:00,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119293897] [2022-04-28 11:13:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:00,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:00,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:00,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175971070] [2022-04-28 11:13:00,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:00,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:00,073 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:00,078 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:00,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:00,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:00,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:00,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:00,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-28 11:13:00,260 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:00,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:13:00,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-28 11:13:00,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-28 11:13:00,261 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:00,264 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:00,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:00,265 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:00,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-28 11:13:00,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-28 11:13:00,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:13:00,266 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:00,266 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:00,267 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:00,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-28 11:13:00,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-28 11:13:00,272 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:00,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:00,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119293897] [2022-04-28 11:13:00,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:00,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175971070] [2022-04-28 11:13:00,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175971070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:00,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:00,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:00,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:00,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312736860] [2022-04-28 11:13:00,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312736860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:00,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:00,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674177619] [2022-04-28 11:13:00,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:00,279 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:00,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:00,279 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:00,290 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:00,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:00,292 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:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:00,533 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-28 11:13:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:00,533 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:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:00,533 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:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:00,535 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:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:00,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:00,589 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:00,591 INFO L225 Difference]: With dead ends: 50 [2022-04-28 11:13:00,591 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 11:13:00,591 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:00,592 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:00,592 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:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 11:13:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-28 11:13:00,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:00,601 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:00,602 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:00,602 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:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:00,604 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:13:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:13:00,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:00,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:00,605 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:00,605 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:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:00,607 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:13:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:13:00,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:00,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:00,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:00,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:00,608 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:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-28 11:13:00,610 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-28 11:13:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:00,610 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-28 11:13:00,610 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:00,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-28 11:13:00,662 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:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-28 11:13:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:13:00,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:00,663 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:00,681 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:00,863 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:00,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-28 11:13:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:00,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1583840859] [2022-04-28 11:13:00,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-28 11:13:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:00,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552977064] [2022-04-28 11:13:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:00,873 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:00,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905786383] [2022-04-28 11:13:00,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:00,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:00,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:00,874 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:00,875 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:00,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:00,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:00,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:00,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:01,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-28 11:13:01,011 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:01,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:01,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-28 11:13:01,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-28 11:13:01,012 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:01,013 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:01,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:01,013 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:01,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:13:01,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:13:01,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:01,014 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:01,014 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:01,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:13:01,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:13:01,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:01,015 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:01,016 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:01,016 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:01,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 11:13:01,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 11:13:01,017 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:01,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:01,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:01,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552977064] [2022-04-28 11:13:01,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:01,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905786383] [2022-04-28 11:13:01,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905786383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:01,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:01,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:01,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:01,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1583840859] [2022-04-28 11:13:01,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1583840859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:01,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:01,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129046854] [2022-04-28 11:13:01,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:01,018 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:01,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:01,018 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:01,035 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:01,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:01,037 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:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:11,368 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:13:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:11,369 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:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:11,369 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:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:11,370 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:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:11,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:11,441 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:11,442 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:13:11,442 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:13:11,442 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:11,443 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:11,443 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:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:13:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-28 11:13:11,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:11,456 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:11,457 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:11,457 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:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:11,459 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:13:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:13:11,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:11,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:11,460 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:11,460 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:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:11,462 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:13:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:13:11,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:11,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:11,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:11,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:11,463 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:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-28 11:13:11,468 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-28 11:13:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:11,469 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-28 11:13:11,469 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:11,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-28 11:13:11,532 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:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-28 11:13:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:13:11,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:11,533 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:11,549 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:11,743 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:11,743 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-28 11:13:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:11,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [266686866] [2022-04-28 11:13:11,744 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-28 11:13:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:11,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787231461] [2022-04-28 11:13:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:11,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:11,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649161013] [2022-04-28 11:13:11,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:11,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:11,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:11,767 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:11,768 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:11,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:11,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:11,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:13:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:11,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:11,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-28 11:13:11,940 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:11,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:11,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-28 11:13:11,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-28 11:13:11,941 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:11,941 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:11,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:11,942 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:11,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:11,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:11,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:11,943 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:11,943 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:11,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:11,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:11,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:11,944 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:11,944 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:11,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:11,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:11,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:11,947 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:11,947 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:11,948 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:11,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-28 11:13:11,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-28 11:13:11,948 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:11,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:11,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787231461] [2022-04-28 11:13:11,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:11,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649161013] [2022-04-28 11:13:11,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649161013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:11,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:11,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:11,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:11,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [266686866] [2022-04-28 11:13:11,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [266686866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:11,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:11,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:11,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639816569] [2022-04-28 11:13:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:11,950 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:11,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:11,951 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:11,966 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:11,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:11,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:11,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:11,967 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:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:12,212 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-28 11:13:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:12,212 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:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:12,212 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:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:12,213 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:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:12,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:12,270 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:12,271 INFO L225 Difference]: With dead ends: 62 [2022-04-28 11:13:12,271 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 11:13:12,271 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:12,272 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:12,272 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:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 11:13:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 11:13:12,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:12,289 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:12,289 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:12,290 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:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:12,291 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:13:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:12,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:12,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:12,292 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:12,292 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:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:12,294 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:13:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:12,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:12,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:12,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:12,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:12,294 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:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 11:13:12,296 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-28 11:13:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:12,296 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 11:13:12,296 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:12,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 11:13:12,357 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:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:13:12,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:12,358 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:12,376 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:12,558 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:12,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-28 11:13:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:12,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1437225251] [2022-04-28 11:13:12,887 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:12,887 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-28 11:13:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:12,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607461966] [2022-04-28 11:13:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:12,900 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:12,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990730217] [2022-04-28 11:13:12,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:12,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:12,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:12,901 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:12,902 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:12,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:12,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:12,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:12,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:13,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:13:13,110 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:13,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:13,110 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:13,111 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:13,112 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:13,112 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:13,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,114 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:13,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,124 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:13,124 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:13,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,126 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:13,126 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:13,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,127 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:13,128 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:13,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,134 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:13,134 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:13,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:13,136 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:13,136 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:13,136 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:13,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:13:13,137 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:13,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:13,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-28 11:13:13,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-28 11:13:13,137 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:13:13,137 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:13,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:13,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:13:13,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:13:13,138 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:13,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:13,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:13:13,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:13:13,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:13,279 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:13,280 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:13:13,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:13,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:13,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:13,280 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:13,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:13:13,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {1972#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1968#(< |main_#t~post5| 100)} is VALID [2022-04-28 11:13:13,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {1972#(< ~counter~0 100)} 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 100)} is VALID [2022-04-28 11:13:13,281 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #67#return; {1972#(< ~counter~0 100)} is VALID [2022-04-28 11:13:13,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:13,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:13,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:13,282 INFO L272 TraceCheckUtils]: 28: Hoare triple {1972#(< ~counter~0 100)} 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:13,282 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #65#return; {1972#(< ~counter~0 100)} is VALID [2022-04-28 11:13:13,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:13,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:13,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:13,283 INFO L272 TraceCheckUtils]: 23: Hoare triple {1972#(< ~counter~0 100)} 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:13,283 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #63#return; {1972#(< ~counter~0 100)} is VALID [2022-04-28 11:13:13,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:13,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:13,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:13,284 INFO L272 TraceCheckUtils]: 18: Hoare triple {1972#(< ~counter~0 100)} 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:13,284 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #61#return; {1972#(< ~counter~0 100)} is VALID [2022-04-28 11:13:13,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:13,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:13,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:13,285 INFO L272 TraceCheckUtils]: 13: Hoare triple {1972#(< ~counter~0 100)} 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:13,285 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #59#return; {1972#(< ~counter~0 100)} is VALID [2022-04-28 11:13:13,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:13,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:13,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:13,285 INFO L272 TraceCheckUtils]: 8: Hoare triple {1972#(< ~counter~0 100)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:13,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1972#(< ~counter~0 100)} is VALID [2022-04-28 11:13:13,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {2057#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1972#(< ~counter~0 100)} is VALID [2022-04-28 11:13:13,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#(< ~counter~0 99)} 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 99)} is VALID [2022-04-28 11:13:13,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 99)} call #t~ret6 := main(); {2057#(< ~counter~0 99)} is VALID [2022-04-28 11:13:13,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 99)} {1801#true} #81#return; {2057#(< ~counter~0 99)} is VALID [2022-04-28 11:13:13,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 99)} assume true; {2057#(< ~counter~0 99)} is VALID [2022-04-28 11:13:13,288 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 99)} is VALID [2022-04-28 11:13:13,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:13:13,288 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:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:13,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607461966] [2022-04-28 11:13:13,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:13,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990730217] [2022-04-28 11:13:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990730217] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:13,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:13,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 11:13:13,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:13,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1437225251] [2022-04-28 11:13:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1437225251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:13,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:13,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642355097] [2022-04-28 11:13:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:13,290 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:13,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:13,290 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:13,310 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:13,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:13,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:13,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:13:13,311 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:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:13,567 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-28 11:13:13,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:13,567 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:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:13,568 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:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:13:13,569 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:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:13:13,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-28 11:13:13,621 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:13,640 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:13:13,640 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:13:13,641 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:13,641 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:13,641 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:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:13:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 11:13:13,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:13,680 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:13,681 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:13,681 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:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:13,682 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:13:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:13,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:13,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:13,683 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:13,683 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:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:13,685 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:13:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:13,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:13,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:13,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:13,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:13,685 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:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 11:13:13,687 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-28 11:13:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:13,687 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 11:13:13,687 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:13,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 11:13:13,745 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:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:13:13,747 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:13,747 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:13,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 11:13:13,963 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:13,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:13,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-28 11:13:13,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:13,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74660665] [2022-04-28 11:13:14,245 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:14,245 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-28 11:13:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:14,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422503942] [2022-04-28 11:13:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:14,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:14,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965443435] [2022-04-28 11:13:14,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:14,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:14,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:14,273 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:14,275 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:14,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:14,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:14,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:13:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:14,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:14,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:13:14,496 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:14,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:13:14,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:13:14,497 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:14,497 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:14,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:14,498 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:14,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,499 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:14,499 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:14,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,501 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:14,501 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:14,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,502 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:14,502 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:14,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,503 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:14,503 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:14,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,504 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:14,504 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:14,505 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:14,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:14,505 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:14,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,506 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:14,506 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:14,507 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:14,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:13:14,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:13:14,507 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:14,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:14,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:13:14,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:13:14,667 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:14,668 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:14,668 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:14,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,669 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:14,670 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 < 100);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:14,672 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:14,679 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:14,680 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:14,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,680 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:14,680 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:14,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,681 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:14,681 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:14,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,682 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:14,682 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:14,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,682 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:14,683 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:14,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:14,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:14,683 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:14,683 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 < 100);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:14,684 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:14,684 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:14,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:13:14,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:13:14,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:14,685 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:14,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:13:14,685 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:14,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:14,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422503942] [2022-04-28 11:13:14,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:14,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965443435] [2022-04-28 11:13:14,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965443435] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:14,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:14,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:13:14,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:14,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74660665] [2022-04-28 11:13:14,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74660665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:14,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:14,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037125341] [2022-04-28 11:13:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:14,686 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:14,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:14,687 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:14,708 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:14,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:14,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:14,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:13:14,708 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:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:15,064 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-28 11:13:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:15,064 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:15,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:15,064 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:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:13:15,066 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:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:13:15,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-28 11:13:15,125 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:15,127 INFO L225 Difference]: With dead ends: 78 [2022-04-28 11:13:15,127 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 11:13:15,127 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:15,127 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:15,127 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:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 11:13:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-28 11:13:15,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:15,167 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:15,167 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:15,167 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:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:15,169 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:13:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:13:15,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:15,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:15,170 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:15,170 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:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:15,172 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:13:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:13:15,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:15,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:15,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:15,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:15,173 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:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-28 11:13:15,174 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-28 11:13:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:15,175 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-28 11:13:15,175 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:15,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-28 11:13:15,241 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:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 11:13:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:13:15,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:15,242 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:15,257 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:15,447 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:15,447 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-28 11:13:15,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:15,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1775334098] [2022-04-28 11:13:15,694 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:15,694 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-28 11:13:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:15,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603489876] [2022-04-28 11:13:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:15,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:15,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277219326] [2022-04-28 11:13:15,702 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:15,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:15,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:15,703 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:15,703 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:15,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:15,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:15,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:13:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:15,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:16,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:13:16,011 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:16,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:13:16,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:13:16,012 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:16,012 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:16,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 100);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:13:16,012 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:16,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:16,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:16,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,012 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:13:16,012 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:16,013 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:16,013 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:16,014 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:16,014 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:16,014 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:16,015 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:16,015 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:16,015 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:16,016 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:16,016 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:16,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:16,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:16,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,017 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:16,017 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:16,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:16,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:16,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,017 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:16,022 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:16,023 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:16,023 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 < 100);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:16,023 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:16,024 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:16,024 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:16,024 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:16,025 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:16,025 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:16,026 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:16,026 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:16,026 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:16,027 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:16,027 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:16,028 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:16,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:13:16,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:13:16,028 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:16,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:16,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:13:16,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:13:16,530 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:16,531 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:16,531 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:16,531 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:16,532 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:16,532 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:16,532 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:16,533 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:16,533 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:16,534 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:16,534 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:16,534 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:16,535 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 < 100);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:16,535 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:16,540 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:16,540 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:16,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:16,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:16,541 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:16,541 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:16,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:16,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:16,541 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:16,542 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:16,542 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:16,543 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:16,543 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:16,543 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:16,543 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-28 11:13:16,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:16,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:16,543 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:16,544 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:13:16,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:13:16,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:13:16,544 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:16,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 100);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:13:16,544 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:16,544 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:16,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:13:16,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:13:16,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:13:16,544 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:16,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:13:16,545 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:16,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:16,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603489876] [2022-04-28 11:13:16,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:16,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277219326] [2022-04-28 11:13:16,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277219326] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:16,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:16,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:13:16,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:16,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1775334098] [2022-04-28 11:13:16,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1775334098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:16,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:16,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:13:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193549416] [2022-04-28 11:13:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:16,546 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:16,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:16,546 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:16,578 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:16,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:13:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:13:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:13:16,578 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:19,135 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:24,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:28,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:28,813 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-28 11:13:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:13:28,813 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:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:28,814 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:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-28 11:13:28,815 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:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-28 11:13:28,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-28 11:13:30,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:30,889 INFO L225 Difference]: With dead ends: 74 [2022-04-28 11:13:30,889 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 11:13:30,890 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:13:30,890 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:30,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 91 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 156 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-04-28 11:13:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 11:13:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 11:13:30,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:30,941 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:13:30,941 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:13:30,941 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:13:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:30,947 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-28 11:13:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:13:30,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:30,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:30,948 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:13:30,948 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:13:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:30,950 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-28 11:13:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:13:30,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:30,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:30,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:30,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:30,950 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:13:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-28 11:13:30,957 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 50 [2022-04-28 11:13:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:30,957 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-28 11:13:30,957 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:13:30,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-28 11:13:32,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 11:13:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 11:13:32,405 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:32,405 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:13:32,422 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:13:32,605 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:13:32,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-28 11:13:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:32,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089890983] [2022-04-28 11:13:32,866 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:32,866 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-28 11:13:32,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:32,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848028675] [2022-04-28 11:13:32,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:32,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:32,873 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:32,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9964627] [2022-04-28 11:13:32,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:32,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:32,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:32,891 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:13:32,902 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:13:32,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:32,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:32,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:13:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:32,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:33,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {3902#true} call ULTIMATE.init(); {3902#true} is VALID [2022-04-28 11:13:33,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {3902#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; {3902#true} is VALID [2022-04-28 11:13:33,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3902#true} {3902#true} #81#return; {3902#true} is VALID [2022-04-28 11:13:33,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {3902#true} call #t~ret6 := main(); {3902#true} is VALID [2022-04-28 11:13:33,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {3902#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; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:33,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {3922#(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; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:33,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:33,391 INFO L272 TraceCheckUtils]: 8: Hoare triple {3922#(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)); {3902#true} is VALID [2022-04-28 11:13:33,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,392 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:33,392 INFO L272 TraceCheckUtils]: 13: Hoare triple {3922#(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)); {3902#true} is VALID [2022-04-28 11:13:33,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,393 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:33,393 INFO L272 TraceCheckUtils]: 18: Hoare triple {3922#(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)); {3902#true} is VALID [2022-04-28 11:13:33,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,393 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:33,394 INFO L272 TraceCheckUtils]: 23: Hoare triple {3922#(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)); {3902#true} is VALID [2022-04-28 11:13:33,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,404 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:33,404 INFO L272 TraceCheckUtils]: 28: Hoare triple {3922#(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)); {3902#true} is VALID [2022-04-28 11:13:33,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,405 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:33,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {3922#(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; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:33,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {4007#(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; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:33,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:33,406 INFO L272 TraceCheckUtils]: 36: Hoare triple {4007#(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)); {3902#true} is VALID [2022-04-28 11:13:33,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,407 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #59#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:33,407 INFO L272 TraceCheckUtils]: 41: Hoare triple {4007#(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)); {3902#true} is VALID [2022-04-28 11:13:33,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,407 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #61#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:33,407 INFO L272 TraceCheckUtils]: 46: Hoare triple {4007#(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)); {3902#true} is VALID [2022-04-28 11:13:33,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,408 INFO L290 TraceCheckUtils]: 48: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,408 INFO L290 TraceCheckUtils]: 49: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,408 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #63#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:33,408 INFO L272 TraceCheckUtils]: 51: Hoare triple {4007#(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)); {3902#true} is VALID [2022-04-28 11:13:33,408 INFO L290 TraceCheckUtils]: 52: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,409 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #65#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:33,409 INFO L272 TraceCheckUtils]: 56: Hoare triple {4007#(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)); {3902#true} is VALID [2022-04-28 11:13:33,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,410 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #67#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:33,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4092#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:33,410 INFO L272 TraceCheckUtils]: 62: Hoare triple {4092#(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)); {3902#true} is VALID [2022-04-28 11:13:33,411 INFO L290 TraceCheckUtils]: 63: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-28 11:13:33,411 INFO L290 TraceCheckUtils]: 64: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-28 11:13:33,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-28 11:13:33,411 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3902#true} {4092#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4092#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:33,412 INFO L272 TraceCheckUtils]: 67: Hoare triple {4092#(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)); {4111#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:33,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {4111#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4115#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:33,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {4115#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3903#false} is VALID [2022-04-28 11:13:33,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {3903#false} assume !false; {3903#false} is VALID [2022-04-28 11:13:33,413 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:13:33,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:33,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848028675] [2022-04-28 11:13:33,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9964627] [2022-04-28 11:13:33,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9964627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:13:33,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:13:33,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:13:33,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:33,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089890983] [2022-04-28 11:13:33,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089890983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:33,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:33,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:13:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328634057] [2022-04-28 11:13:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:33,750 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:13:33,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:33,751 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:13:33,791 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:13:33,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:13:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:33,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:13:33,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:33,792 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:13:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:34,220 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-04-28 11:13:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:13:34,220 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:13:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:34,220 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:13:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:13:34,222 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:13:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:13:34,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-28 11:13:34,279 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:13:34,281 INFO L225 Difference]: With dead ends: 84 [2022-04-28 11:13:34,281 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 11:13:34,282 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:13:34,282 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:34,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 11:13:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-28 11:13:34,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:34,345 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:13:34,345 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:13:34,346 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:13:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:34,351 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-28 11:13:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-28 11:13:34,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:34,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:34,352 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:13:34,352 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:13:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:34,355 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-28 11:13:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-28 11:13:34,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:34,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:34,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:34,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:34,356 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:13:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-04-28 11:13:34,357 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 71 [2022-04-28 11:13:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:34,357 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-04-28 11:13:34,357 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:13:34,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 92 transitions. [2022-04-28 11:13:34,468 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:13:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-28 11:13:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 11:13:34,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:34,469 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:13:34,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 11:13:34,685 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:13:34,685 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-28 11:13:34,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:34,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617289905] [2022-04-28 11:13:34,938 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:34,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-28 11:13:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:34,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125095443] [2022-04-28 11:13:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:34,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:34,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873141857] [2022-04-28 11:13:34,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:34,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:34,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:34,955 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:13:34,983 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:13:35,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:35,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:35,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:13:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:35,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:35,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {4739#true} call ULTIMATE.init(); {4739#true} is VALID [2022-04-28 11:13:35,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {4739#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; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:35,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {4747#(<= ~counter~0 0)} assume true; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:35,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4747#(<= ~counter~0 0)} {4739#true} #81#return; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:35,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {4747#(<= ~counter~0 0)} call #t~ret6 := main(); {4747#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:35,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {4747#(<= ~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; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:35,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {4747#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {4763#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,298 INFO L272 TraceCheckUtils]: 8: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,299 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #59#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,299 INFO L272 TraceCheckUtils]: 13: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,300 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #61#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,301 INFO L272 TraceCheckUtils]: 18: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,302 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #63#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,302 INFO L272 TraceCheckUtils]: 23: Hoare triple {4763#(<= ~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)); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,303 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #65#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,304 INFO L272 TraceCheckUtils]: 28: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,305 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #67#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {4763#(<= ~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; {4763#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:35,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {4763#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {4848#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,306 INFO L272 TraceCheckUtils]: 36: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,307 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #59#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,308 INFO L272 TraceCheckUtils]: 41: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,309 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #61#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,309 INFO L272 TraceCheckUtils]: 46: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,310 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #63#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,310 INFO L272 TraceCheckUtils]: 51: Hoare triple {4848#(<= ~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)); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,312 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #65#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,312 INFO L272 TraceCheckUtils]: 56: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,313 INFO L290 TraceCheckUtils]: 59: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,313 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #67#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {4848#(<= ~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; {4848#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:35,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {4848#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4933#(<= |main_#t~post5| 2)} is VALID [2022-04-28 11:13:35,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {4933#(<= |main_#t~post5| 2)} assume !(#t~post5 < 100);havoc #t~post5; {4740#false} is VALID [2022-04-28 11:13:35,314 INFO L272 TraceCheckUtils]: 64: Hoare triple {4740#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4740#false} is VALID [2022-04-28 11:13:35,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-28 11:13:35,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {4740#false} assume !(0 == ~cond); {4740#false} is VALID [2022-04-28 11:13:35,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {4740#false} assume true; {4740#false} is VALID [2022-04-28 11:13:35,314 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4740#false} {4740#false} #69#return; {4740#false} is VALID [2022-04-28 11:13:35,315 INFO L272 TraceCheckUtils]: 69: Hoare triple {4740#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4740#false} is VALID [2022-04-28 11:13:35,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-28 11:13:35,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {4740#false} assume 0 == ~cond; {4740#false} is VALID [2022-04-28 11:13:35,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {4740#false} assume !false; {4740#false} is VALID [2022-04-28 11:13:35,316 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:13:35,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:35,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {4740#false} assume !false; {4740#false} is VALID [2022-04-28 11:13:35,562 INFO L290 TraceCheckUtils]: 71: Hoare triple {4740#false} assume 0 == ~cond; {4740#false} is VALID [2022-04-28 11:13:35,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-28 11:13:35,562 INFO L272 TraceCheckUtils]: 69: Hoare triple {4740#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4740#false} is VALID [2022-04-28 11:13:35,562 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4739#true} {4740#false} #69#return; {4740#false} is VALID [2022-04-28 11:13:35,562 INFO L290 TraceCheckUtils]: 67: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,562 INFO L290 TraceCheckUtils]: 66: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,562 INFO L290 TraceCheckUtils]: 65: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,562 INFO L272 TraceCheckUtils]: 64: Hoare triple {4740#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {4991#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {4740#false} is VALID [2022-04-28 11:13:35,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {4995#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4991#(< |main_#t~post5| 100)} is VALID [2022-04-28 11:13:35,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {4995#(< ~counter~0 100)} 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; {4995#(< ~counter~0 100)} is VALID [2022-04-28 11:13:35,564 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #67#return; {4995#(< ~counter~0 100)} is VALID [2022-04-28 11:13:35,564 INFO L290 TraceCheckUtils]: 59: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,564 INFO L272 TraceCheckUtils]: 56: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,565 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #65#return; {4995#(< ~counter~0 100)} is VALID [2022-04-28 11:13:35,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,565 INFO L272 TraceCheckUtils]: 51: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,565 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #63#return; {4995#(< ~counter~0 100)} is VALID [2022-04-28 11:13:35,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,566 INFO L272 TraceCheckUtils]: 46: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,566 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #61#return; {4995#(< ~counter~0 100)} is VALID [2022-04-28 11:13:35,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,567 INFO L272 TraceCheckUtils]: 41: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,567 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #59#return; {4995#(< ~counter~0 100)} is VALID [2022-04-28 11:13:35,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,567 INFO L272 TraceCheckUtils]: 36: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {4995#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {4995#(< ~counter~0 100)} is VALID [2022-04-28 11:13:35,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {5080#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4995#(< ~counter~0 100)} is VALID [2022-04-28 11:13:35,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {5080#(< ~counter~0 99)} 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; {5080#(< ~counter~0 99)} is VALID [2022-04-28 11:13:35,569 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #67#return; {5080#(< ~counter~0 99)} is VALID [2022-04-28 11:13:35,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,569 INFO L272 TraceCheckUtils]: 28: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,570 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #65#return; {5080#(< ~counter~0 99)} is VALID [2022-04-28 11:13:35,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,570 INFO L272 TraceCheckUtils]: 23: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,571 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #63#return; {5080#(< ~counter~0 99)} is VALID [2022-04-28 11:13:35,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,571 INFO L272 TraceCheckUtils]: 18: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,572 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #61#return; {5080#(< ~counter~0 99)} is VALID [2022-04-28 11:13:35,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,572 INFO L272 TraceCheckUtils]: 13: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,572 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #59#return; {5080#(< ~counter~0 99)} is VALID [2022-04-28 11:13:35,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 11:13:35,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 11:13:35,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 11:13:35,573 INFO L272 TraceCheckUtils]: 8: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-28 11:13:35,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {5080#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5080#(< ~counter~0 99)} is VALID [2022-04-28 11:13:35,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {5165#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5080#(< ~counter~0 99)} is VALID [2022-04-28 11:13:35,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {5165#(< ~counter~0 98)} 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; {5165#(< ~counter~0 98)} is VALID [2022-04-28 11:13:35,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {5165#(< ~counter~0 98)} call #t~ret6 := main(); {5165#(< ~counter~0 98)} is VALID [2022-04-28 11:13:35,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5165#(< ~counter~0 98)} {4739#true} #81#return; {5165#(< ~counter~0 98)} is VALID [2022-04-28 11:13:35,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {5165#(< ~counter~0 98)} assume true; {5165#(< ~counter~0 98)} is VALID [2022-04-28 11:13:35,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {4739#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; {5165#(< ~counter~0 98)} is VALID [2022-04-28 11:13:35,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {4739#true} call ULTIMATE.init(); {4739#true} is VALID [2022-04-28 11:13:35,575 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:13:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:35,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125095443] [2022-04-28 11:13:35,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:35,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873141857] [2022-04-28 11:13:35,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873141857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:35,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:35,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:13:35,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:35,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617289905] [2022-04-28 11:13:35,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617289905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:35,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:35,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422712641] [2022-04-28 11:13:35,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:35,578 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:13:35,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:35,578 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:13:35,617 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:13:35,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:35,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:35,618 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:13:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:36,103 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-28 11:13:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:13:36,103 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:13:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:36,103 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:13:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 11:13:36,104 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:13:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 11:13:36,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 11:13:36,160 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:13:36,161 INFO L225 Difference]: With dead ends: 111 [2022-04-28 11:13:36,161 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:13:36,162 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:13:36,162 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 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:13:36,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:13:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-28 11:13:36,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:36,250 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:13:36,250 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:13:36,251 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:13:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:36,252 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:13:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:13:36,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:36,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:36,253 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:13:36,253 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:13:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:36,254 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:13:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 11:13:36,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:36,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:36,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:36,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:36,255 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:13:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-04-28 11:13:36,256 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 73 [2022-04-28 11:13:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:36,257 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-04-28 11:13:36,257 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:13:36,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 103 transitions. [2022-04-28 11:13:38,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 102 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-04-28 11:13:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:13:38,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:38,391 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:13:38,408 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:13:38,599 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:13:38,600 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-28 11:13:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:38,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548834898] [2022-04-28 11:13:38,839 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:38,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-28 11:13:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:38,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872620839] [2022-04-28 11:13:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:38,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:38,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8575040] [2022-04-28 11:13:38,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:38,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:38,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:38,855 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:13:38,860 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:13:38,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:38,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:38,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:13:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:38,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:39,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {5792#true} call ULTIMATE.init(); {5792#true} is VALID [2022-04-28 11:13:39,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {5792#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; {5792#true} is VALID [2022-04-28 11:13:39,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5792#true} {5792#true} #81#return; {5792#true} is VALID [2022-04-28 11:13:39,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {5792#true} call #t~ret6 := main(); {5792#true} is VALID [2022-04-28 11:13:39,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {5792#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; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:39,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:39,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:39,424 INFO L272 TraceCheckUtils]: 8: Hoare triple {5812#(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)); {5792#true} is VALID [2022-04-28 11:13:39,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,425 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:39,425 INFO L272 TraceCheckUtils]: 13: Hoare triple {5812#(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)); {5792#true} is VALID [2022-04-28 11:13:39,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,425 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:39,425 INFO L272 TraceCheckUtils]: 18: Hoare triple {5812#(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)); {5792#true} is VALID [2022-04-28 11:13:39,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,426 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:39,426 INFO L272 TraceCheckUtils]: 23: Hoare triple {5812#(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)); {5792#true} is VALID [2022-04-28 11:13:39,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,427 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:39,427 INFO L272 TraceCheckUtils]: 28: Hoare triple {5812#(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)); {5792#true} is VALID [2022-04-28 11:13:39,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,427 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:13:39,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {5812#(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; {5897#(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:13:39,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {5897#(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; {5897#(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:13:39,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {5897#(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 < 100);havoc #t~post5; {5897#(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:13:39,429 INFO L272 TraceCheckUtils]: 36: Hoare triple {5897#(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)); {5792#true} is VALID [2022-04-28 11:13:39,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,430 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {5897#(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:13:39,430 INFO L272 TraceCheckUtils]: 41: Hoare triple {5897#(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)); {5792#true} is VALID [2022-04-28 11:13:39,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,430 INFO L290 TraceCheckUtils]: 44: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,430 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {5897#(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:13:39,430 INFO L272 TraceCheckUtils]: 46: Hoare triple {5897#(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)); {5792#true} is VALID [2022-04-28 11:13:39,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,431 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {5897#(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:13:39,431 INFO L272 TraceCheckUtils]: 51: Hoare triple {5897#(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)); {5792#true} is VALID [2022-04-28 11:13:39,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,432 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {5897#(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:13:39,432 INFO L272 TraceCheckUtils]: 56: Hoare triple {5897#(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)); {5792#true} is VALID [2022-04-28 11:13:39,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,433 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {5897#(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:13:39,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {5897#(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); {5982#(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:13:39,434 INFO L272 TraceCheckUtils]: 62: Hoare triple {5982#(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)); {5792#true} is VALID [2022-04-28 11:13:39,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,434 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5792#true} {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {5982#(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:13:39,434 INFO L272 TraceCheckUtils]: 67: Hoare triple {5982#(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)); {5792#true} is VALID [2022-04-28 11:13:39,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-28 11:13:39,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-28 11:13:39,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-28 11:13:39,435 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5792#true} {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {5982#(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:13:39,436 INFO L272 TraceCheckUtils]: 72: Hoare triple {5982#(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)); {6016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:39,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {6016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:39,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {6020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5793#false} is VALID [2022-04-28 11:13:39,437 INFO L290 TraceCheckUtils]: 75: Hoare triple {5793#false} assume !false; {5793#false} is VALID [2022-04-28 11:13:39,437 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:13:39,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872620839] [2022-04-28 11:13:40,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:40,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8575040] [2022-04-28 11:13:40,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8575040] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:13:40,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:13:40,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:13:40,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:40,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548834898] [2022-04-28 11:13:40,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548834898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:40,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:40,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:13:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643157782] [2022-04-28 11:13:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:40,513 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:13:40,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:40,513 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:13:40,545 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:40,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:13:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:13:40,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:40,545 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:13:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:40,946 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 11:13:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:13:40,946 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:13:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:40,947 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:13:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:13:40,948 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:13:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-28 11:13:40,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-28 11:13:41,019 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:13:41,020 INFO L225 Difference]: With dead ends: 96 [2022-04-28 11:13:41,020 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 11:13:41,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:13:41,021 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:13:41,021 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:13:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 11:13:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 11:13:41,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:41,101 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:13:41,101 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:13:41,102 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:13:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:41,103 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-28 11:13:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:13:41,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:41,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:41,103 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:13:41,104 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:13:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:41,105 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-28 11:13:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:13:41,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:41,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:41,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:41,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:41,105 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:13:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-04-28 11:13:41,106 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 76 [2022-04-28 11:13:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:41,107 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-04-28 11:13:41,107 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:13:41,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 92 transitions. [2022-04-28 11:13:41,231 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:13:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-28 11:13:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 11:13:41,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:41,232 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:13:41,250 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:13:41,432 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:13:41,432 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-28 11:13:41,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:41,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [741934929] [2022-04-28 11:13:41,724 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:41,724 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-28 11:13:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:41,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100695486] [2022-04-28 11:13:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:41,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:41,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535297374] [2022-04-28 11:13:41,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:41,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:41,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:41,736 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:13:41,753 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:13:41,792 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:41,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:41,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:13:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:41,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:42,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {6697#true} call ULTIMATE.init(); {6697#true} is VALID [2022-04-28 11:13:42,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {6697#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; {6697#true} is VALID [2022-04-28 11:13:42,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6697#true} {6697#true} #81#return; {6697#true} is VALID [2022-04-28 11:13:42,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {6697#true} call #t~ret6 := main(); {6697#true} is VALID [2022-04-28 11:13:42,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {6697#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; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:42,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {6717#(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; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:42,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:42,370 INFO L272 TraceCheckUtils]: 8: Hoare triple {6717#(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)); {6697#true} is VALID [2022-04-28 11:13:42,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,370 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:42,370 INFO L272 TraceCheckUtils]: 13: Hoare triple {6717#(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)); {6697#true} is VALID [2022-04-28 11:13:42,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,371 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:42,371 INFO L272 TraceCheckUtils]: 18: Hoare triple {6717#(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)); {6697#true} is VALID [2022-04-28 11:13:42,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,372 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:42,372 INFO L272 TraceCheckUtils]: 23: Hoare triple {6717#(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)); {6697#true} is VALID [2022-04-28 11:13:42,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,372 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:42,373 INFO L272 TraceCheckUtils]: 28: Hoare triple {6717#(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)); {6697#true} is VALID [2022-04-28 11:13:42,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,374 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:42,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {6717#(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; {6802#(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:13:42,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {6802#(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; {6802#(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:13:42,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {6802#(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 < 100);havoc #t~post5; {6802#(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:13:42,377 INFO L272 TraceCheckUtils]: 36: Hoare triple {6802#(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)); {6697#true} is VALID [2022-04-28 11:13:42,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,377 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6697#true} {6802#(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; {6802#(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:13:42,378 INFO L272 TraceCheckUtils]: 41: Hoare triple {6802#(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)); {6697#true} is VALID [2022-04-28 11:13:42,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,380 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6697#true} {6802#(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; {6802#(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:13:42,380 INFO L272 TraceCheckUtils]: 46: Hoare triple {6802#(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)); {6697#true} is VALID [2022-04-28 11:13:42,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,381 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6697#true} {6802#(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; {6802#(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:13:42,381 INFO L272 TraceCheckUtils]: 51: Hoare triple {6802#(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)); {6697#true} is VALID [2022-04-28 11:13:42,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {6697#true} ~cond := #in~cond; {6860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:42,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {6860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:42,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {6864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:42,382 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6864#(not (= |__VERIFIER_assert_#in~cond| 0))} {6802#(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; {6802#(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:13:42,382 INFO L272 TraceCheckUtils]: 56: Hoare triple {6802#(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)); {6697#true} is VALID [2022-04-28 11:13:42,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,383 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6697#true} {6802#(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; {6802#(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:13:42,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {6802#(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; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:13:42,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {6889#(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; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:13:42,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:13:42,385 INFO L272 TraceCheckUtils]: 64: Hoare triple {6889#(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)); {6697#true} is VALID [2022-04-28 11:13:42,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,385 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #59#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:13:42,385 INFO L272 TraceCheckUtils]: 69: Hoare triple {6889#(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)); {6697#true} is VALID [2022-04-28 11:13:42,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,385 INFO L290 TraceCheckUtils]: 71: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,385 INFO L290 TraceCheckUtils]: 72: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,386 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #61#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:13:42,386 INFO L272 TraceCheckUtils]: 74: Hoare triple {6889#(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)); {6697#true} is VALID [2022-04-28 11:13:42,386 INFO L290 TraceCheckUtils]: 75: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,386 INFO L290 TraceCheckUtils]: 76: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,386 INFO L290 TraceCheckUtils]: 77: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,387 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #63#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:13:42,387 INFO L272 TraceCheckUtils]: 79: Hoare triple {6889#(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)); {6697#true} is VALID [2022-04-28 11:13:42,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,387 INFO L290 TraceCheckUtils]: 81: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,387 INFO L290 TraceCheckUtils]: 82: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,387 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #65#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:13:42,387 INFO L272 TraceCheckUtils]: 84: Hoare triple {6889#(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)); {6697#true} is VALID [2022-04-28 11:13:42,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,388 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #67#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-28 11:13:42,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !(~n~0 <= ~a~0); {6974#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-28 11:13:42,389 INFO L272 TraceCheckUtils]: 90: Hoare triple {6974#(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)); {6697#true} is VALID [2022-04-28 11:13:42,389 INFO L290 TraceCheckUtils]: 91: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-28 11:13:42,389 INFO L290 TraceCheckUtils]: 92: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-28 11:13:42,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-28 11:13:42,389 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6697#true} {6974#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} #69#return; {6974#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-28 11:13:42,390 INFO L272 TraceCheckUtils]: 95: Hoare triple {6974#(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)); {6993#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:42,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {6993#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6997#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:42,390 INFO L290 TraceCheckUtils]: 97: Hoare triple {6997#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6698#false} is VALID [2022-04-28 11:13:42,391 INFO L290 TraceCheckUtils]: 98: Hoare triple {6698#false} assume !false; {6698#false} is VALID [2022-04-28 11:13:42,391 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:13:42,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:42,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:42,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100695486] [2022-04-28 11:13:42,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:42,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535297374] [2022-04-28 11:13:42,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535297374] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:13:42,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:13:42,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 11:13:42,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:42,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [741934929] [2022-04-28 11:13:42,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [741934929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:42,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:42,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:13:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883148401] [2022-04-28 11:13:42,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:42,754 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:13:42,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:42,754 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:13:42,801 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:13:42,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:13:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:13:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:13:42,802 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:13:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,763 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-28 11:13:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:13:43,763 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:13:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:43,763 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:13:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 11:13:43,764 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:13:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 11:13:43,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-28 11:13:43,844 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:13:43,845 INFO L225 Difference]: With dead ends: 100 [2022-04-28 11:13:43,846 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 11:13:43,846 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:13:43,846 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:43,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:13:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 11:13:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-28 11:13:43,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:43,932 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:13:43,932 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:13:43,932 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:13:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,934 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-28 11:13:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-28 11:13:43,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:43,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:43,935 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:13:43,935 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:13:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:43,936 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-28 11:13:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-28 11:13:43,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:43,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:43,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:43,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:43,937 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:13:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-04-28 11:13:43,938 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 99 [2022-04-28 11:13:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:43,939 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-04-28 11:13:43,939 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:13:43,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 111 transitions. [2022-04-28 11:13:44,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-28 11:13:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 11:13:44,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:44,110 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:13:44,126 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:13:44,315 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:13:44,315 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-28 11:13:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:44,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089196459] [2022-04-28 11:13:44,582 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:44,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-28 11:13:44,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:44,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711533766] [2022-04-28 11:13:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:44,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:44,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:44,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526110869] [2022-04-28 11:13:44,593 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:13:44,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:44,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:44,604 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:13:44,604 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:13:44,832 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:13:44,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:44,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:13:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:44,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:45,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {7719#true} call ULTIMATE.init(); {7719#true} is VALID [2022-04-28 11:13:45,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {7719#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; {7727#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:45,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {7727#(<= ~counter~0 0)} assume true; {7727#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:45,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7727#(<= ~counter~0 0)} {7719#true} #81#return; {7727#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:45,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {7727#(<= ~counter~0 0)} call #t~ret6 := main(); {7727#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:45,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {7727#(<= ~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; {7727#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:45,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {7727#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {7743#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,177 INFO L272 TraceCheckUtils]: 8: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,179 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #59#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,179 INFO L272 TraceCheckUtils]: 13: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,180 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #61#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,181 INFO L272 TraceCheckUtils]: 18: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,190 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #63#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,191 INFO L272 TraceCheckUtils]: 23: Hoare triple {7743#(<= ~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)); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,192 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #65#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,192 INFO L272 TraceCheckUtils]: 28: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,194 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #67#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {7743#(<= ~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; {7743#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:45,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {7743#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {7828#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,195 INFO L272 TraceCheckUtils]: 36: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,196 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #59#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,197 INFO L272 TraceCheckUtils]: 41: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,198 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #61#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,198 INFO L272 TraceCheckUtils]: 46: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,199 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #63#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,206 INFO L272 TraceCheckUtils]: 51: Hoare triple {7828#(<= ~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)); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,207 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #65#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,207 INFO L272 TraceCheckUtils]: 56: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,209 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #67#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {7828#(<= ~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; {7828#(<= ~counter~0 2)} is VALID [2022-04-28 11:13:45,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {7828#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {7913#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,210 INFO L272 TraceCheckUtils]: 64: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,211 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #59#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,212 INFO L272 TraceCheckUtils]: 69: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,213 INFO L290 TraceCheckUtils]: 72: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,213 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #61#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,214 INFO L272 TraceCheckUtils]: 74: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,215 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #63#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,216 INFO L272 TraceCheckUtils]: 79: Hoare triple {7913#(<= ~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)); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,216 INFO L290 TraceCheckUtils]: 80: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,216 INFO L290 TraceCheckUtils]: 81: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,216 INFO L290 TraceCheckUtils]: 82: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,217 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #65#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,218 INFO L272 TraceCheckUtils]: 84: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,218 INFO L290 TraceCheckUtils]: 85: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,218 INFO L290 TraceCheckUtils]: 86: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,219 INFO L290 TraceCheckUtils]: 87: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,219 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #67#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,219 INFO L290 TraceCheckUtils]: 89: Hoare triple {7913#(<= ~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; {7913#(<= ~counter~0 3)} is VALID [2022-04-28 11:13:45,220 INFO L290 TraceCheckUtils]: 90: Hoare triple {7913#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7998#(<= |main_#t~post5| 3)} is VALID [2022-04-28 11:13:45,220 INFO L290 TraceCheckUtils]: 91: Hoare triple {7998#(<= |main_#t~post5| 3)} assume !(#t~post5 < 100);havoc #t~post5; {7720#false} is VALID [2022-04-28 11:13:45,220 INFO L272 TraceCheckUtils]: 92: Hoare triple {7720#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7720#false} is VALID [2022-04-28 11:13:45,220 INFO L290 TraceCheckUtils]: 93: Hoare triple {7720#false} ~cond := #in~cond; {7720#false} is VALID [2022-04-28 11:13:45,220 INFO L290 TraceCheckUtils]: 94: Hoare triple {7720#false} assume !(0 == ~cond); {7720#false} is VALID [2022-04-28 11:13:45,220 INFO L290 TraceCheckUtils]: 95: Hoare triple {7720#false} assume true; {7720#false} is VALID [2022-04-28 11:13:45,221 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7720#false} {7720#false} #69#return; {7720#false} is VALID [2022-04-28 11:13:45,221 INFO L272 TraceCheckUtils]: 97: Hoare triple {7720#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7720#false} is VALID [2022-04-28 11:13:45,221 INFO L290 TraceCheckUtils]: 98: Hoare triple {7720#false} ~cond := #in~cond; {7720#false} is VALID [2022-04-28 11:13:45,221 INFO L290 TraceCheckUtils]: 99: Hoare triple {7720#false} assume 0 == ~cond; {7720#false} is VALID [2022-04-28 11:13:45,221 INFO L290 TraceCheckUtils]: 100: Hoare triple {7720#false} assume !false; {7720#false} is VALID [2022-04-28 11:13:45,221 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:13:45,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:45,559 INFO L290 TraceCheckUtils]: 100: Hoare triple {7720#false} assume !false; {7720#false} is VALID [2022-04-28 11:13:45,559 INFO L290 TraceCheckUtils]: 99: Hoare triple {7720#false} assume 0 == ~cond; {7720#false} is VALID [2022-04-28 11:13:45,559 INFO L290 TraceCheckUtils]: 98: Hoare triple {7720#false} ~cond := #in~cond; {7720#false} is VALID [2022-04-28 11:13:45,559 INFO L272 TraceCheckUtils]: 97: Hoare triple {7720#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7720#false} is VALID [2022-04-28 11:13:45,559 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7719#true} {7720#false} #69#return; {7720#false} is VALID [2022-04-28 11:13:45,559 INFO L290 TraceCheckUtils]: 95: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,559 INFO L290 TraceCheckUtils]: 94: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,559 INFO L290 TraceCheckUtils]: 93: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,560 INFO L272 TraceCheckUtils]: 92: Hoare triple {7720#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,560 INFO L290 TraceCheckUtils]: 91: Hoare triple {8056#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {7720#false} is VALID [2022-04-28 11:13:45,560 INFO L290 TraceCheckUtils]: 90: Hoare triple {8060#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8056#(< |main_#t~post5| 100)} is VALID [2022-04-28 11:13:45,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {8060#(< ~counter~0 100)} 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; {8060#(< ~counter~0 100)} is VALID [2022-04-28 11:13:45,561 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #67#return; {8060#(< ~counter~0 100)} is VALID [2022-04-28 11:13:45,561 INFO L290 TraceCheckUtils]: 87: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,561 INFO L290 TraceCheckUtils]: 86: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,561 INFO L272 TraceCheckUtils]: 84: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,562 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #65#return; {8060#(< ~counter~0 100)} is VALID [2022-04-28 11:13:45,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,562 INFO L290 TraceCheckUtils]: 80: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,562 INFO L272 TraceCheckUtils]: 79: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,562 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #63#return; {8060#(< ~counter~0 100)} is VALID [2022-04-28 11:13:45,562 INFO L290 TraceCheckUtils]: 77: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,563 INFO L272 TraceCheckUtils]: 74: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,563 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #61#return; {8060#(< ~counter~0 100)} is VALID [2022-04-28 11:13:45,563 INFO L290 TraceCheckUtils]: 72: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,563 INFO L290 TraceCheckUtils]: 71: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,563 INFO L290 TraceCheckUtils]: 70: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,563 INFO L272 TraceCheckUtils]: 69: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,564 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #59#return; {8060#(< ~counter~0 100)} is VALID [2022-04-28 11:13:45,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,564 INFO L272 TraceCheckUtils]: 64: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {8060#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {8060#(< ~counter~0 100)} is VALID [2022-04-28 11:13:45,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {8145#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8060#(< ~counter~0 100)} is VALID [2022-04-28 11:13:45,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {8145#(< ~counter~0 99)} 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; {8145#(< ~counter~0 99)} is VALID [2022-04-28 11:13:45,566 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #67#return; {8145#(< ~counter~0 99)} is VALID [2022-04-28 11:13:45,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,566 INFO L272 TraceCheckUtils]: 56: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,566 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #65#return; {8145#(< ~counter~0 99)} is VALID [2022-04-28 11:13:45,566 INFO L290 TraceCheckUtils]: 54: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,567 INFO L272 TraceCheckUtils]: 51: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,567 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #63#return; {8145#(< ~counter~0 99)} is VALID [2022-04-28 11:13:45,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,567 INFO L272 TraceCheckUtils]: 46: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,568 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #61#return; {8145#(< ~counter~0 99)} is VALID [2022-04-28 11:13:45,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,568 INFO L272 TraceCheckUtils]: 41: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,568 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #59#return; {8145#(< ~counter~0 99)} is VALID [2022-04-28 11:13:45,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,569 INFO L272 TraceCheckUtils]: 36: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {8145#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {8145#(< ~counter~0 99)} is VALID [2022-04-28 11:13:45,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {8230#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8145#(< ~counter~0 99)} is VALID [2022-04-28 11:13:45,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {8230#(< ~counter~0 98)} 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; {8230#(< ~counter~0 98)} is VALID [2022-04-28 11:13:45,570 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #67#return; {8230#(< ~counter~0 98)} is VALID [2022-04-28 11:13:45,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,571 INFO L272 TraceCheckUtils]: 28: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,571 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #65#return; {8230#(< ~counter~0 98)} is VALID [2022-04-28 11:13:45,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,571 INFO L272 TraceCheckUtils]: 23: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,572 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #63#return; {8230#(< ~counter~0 98)} is VALID [2022-04-28 11:13:45,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,572 INFO L272 TraceCheckUtils]: 18: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,573 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #61#return; {8230#(< ~counter~0 98)} is VALID [2022-04-28 11:13:45,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,573 INFO L272 TraceCheckUtils]: 13: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,573 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #59#return; {8230#(< ~counter~0 98)} is VALID [2022-04-28 11:13:45,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-28 11:13:45,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-28 11:13:45,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-28 11:13:45,574 INFO L272 TraceCheckUtils]: 8: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-28 11:13:45,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {8230#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {8230#(< ~counter~0 98)} is VALID [2022-04-28 11:13:45,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {8315#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8230#(< ~counter~0 98)} is VALID [2022-04-28 11:13:45,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {8315#(< ~counter~0 97)} 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; {8315#(< ~counter~0 97)} is VALID [2022-04-28 11:13:45,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {8315#(< ~counter~0 97)} call #t~ret6 := main(); {8315#(< ~counter~0 97)} is VALID [2022-04-28 11:13:45,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8315#(< ~counter~0 97)} {7719#true} #81#return; {8315#(< ~counter~0 97)} is VALID [2022-04-28 11:13:45,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {8315#(< ~counter~0 97)} assume true; {8315#(< ~counter~0 97)} is VALID [2022-04-28 11:13:45,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {7719#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; {8315#(< ~counter~0 97)} is VALID [2022-04-28 11:13:45,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {7719#true} call ULTIMATE.init(); {7719#true} is VALID [2022-04-28 11:13:45,577 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:13:45,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711533766] [2022-04-28 11:13:45,577 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526110869] [2022-04-28 11:13:45,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526110869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:45,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:45,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 11:13:45,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089196459] [2022-04-28 11:13:45,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089196459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:45,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:45,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:13:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572396944] [2022-04-28 11:13:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:45,578 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:13:45,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:45,578 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:13:45,626 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:45,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:13:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:13:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:13:45,627 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:13:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:46,105 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-04-28 11:13:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:13:46,106 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:13:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:46,108 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:13:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:13:46,110 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:13:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:13:46,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-28 11:13:46,176 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:13:46,178 INFO L225 Difference]: With dead ends: 127 [2022-04-28 11:13:46,178 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 11:13:46,178 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:13:46,178 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:46,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 151 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 11:13:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-04-28 11:13:46,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:46,281 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:13:46,281 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:13:46,281 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:13:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:46,292 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-28 11:13:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-28 11:13:46,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:46,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:46,293 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:13:46,294 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:13:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:46,296 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-28 11:13:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-28 11:13:46,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:46,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:46,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:46,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:46,299 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:13:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-04-28 11:13:46,301 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 101 [2022-04-28 11:13:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:46,301 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-04-28 11:13:46,301 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:13:46,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 122 transitions. [2022-04-28 11:13:46,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-04-28 11:13:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 11:13:46,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:46,458 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:13:46,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 11:13:46,662 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:13:46,662 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 3 times [2022-04-28 11:13:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:46,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980360180] [2022-04-28 11:13:46,911 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:46,911 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 4 times [2022-04-28 11:13:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:46,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207064004] [2022-04-28 11:13:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:46,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:46,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41831988] [2022-04-28 11:13:46,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:46,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:46,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:46,926 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:13:46,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process