/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:12:02,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:12:02,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:12:02,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:12:02,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:12:02,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:12:02,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:12:02,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:12:02,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:12:02,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:12:02,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:12:02,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:12:02,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:12:02,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:12:02,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:12:02,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:12:02,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:12:02,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:12:02,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:12:02,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:12:02,273 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:12:02,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:12:02,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:12:02,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:12:02,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:12:02,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:12:02,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:12:02,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:12:02,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:12:02,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:12:02,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:12:02,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:12:02,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:12:02,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:12:02,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:12:02,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:12:02,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:12:02,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:12:02,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:12:02,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:12:02,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:12:02,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:12:02,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:12:02,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:12:02,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:12:02,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:12:02,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:12:02,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:12:02,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:12:02,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:12:02,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:12:02,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:12:02,296 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:12:02,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:12:02,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:12:02,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:12:02,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:12:02,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:12:02,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:12:02,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:12:02,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:12:02,297 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:12:02,297 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:12:02,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:12:02,297 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:12:02,297 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 11:12:02,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:12:02,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:12:02,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:12:02,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:12:02,492 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:12:02,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-08 11:12:02,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a3b50bc/b9f3d81f0bee434fb178cdf194c9f492/FLAGb23751e0e [2022-04-08 11:12:02,867 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:12:02,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-08 11:12:02,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a3b50bc/b9f3d81f0bee434fb178cdf194c9f492/FLAGb23751e0e [2022-04-08 11:12:02,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a3b50bc/b9f3d81f0bee434fb178cdf194c9f492 [2022-04-08 11:12:02,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:12:02,885 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:12:02,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:12:02,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:12:02,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:12:02,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:12:02" (1/1) ... [2022-04-08 11:12:02,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590fe723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:02, skipping insertion in model container [2022-04-08 11:12:02,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:12:02" (1/1) ... [2022-04-08 11:12:02,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:12:02,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:12:03,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-04-08 11:12:03,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:12:03,031 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:12:03,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-04-08 11:12:03,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:12:03,059 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:12:03,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03 WrapperNode [2022-04-08 11:12:03,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:12:03,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:12:03,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:12:03,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:12:03,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (1/1) ... [2022-04-08 11:12:03,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (1/1) ... [2022-04-08 11:12:03,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (1/1) ... [2022-04-08 11:12:03,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (1/1) ... [2022-04-08 11:12:03,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (1/1) ... [2022-04-08 11:12:03,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (1/1) ... [2022-04-08 11:12:03,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (1/1) ... [2022-04-08 11:12:03,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:12:03,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:12:03,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:12:03,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:12:03,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (1/1) ... [2022-04-08 11:12:03,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:12:03,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:03,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 11:12:03,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 11:12:03,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:12:03,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:12:03,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:12:03,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:12:03,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:12:03,169 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:12:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:12:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:12:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:12:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:12:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-08 11:12:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:12:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:12:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:12:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:12:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:12:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:12:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:12:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:12:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:12:03,229 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:12:03,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:12:03,414 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:12:03,436 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:12:03,436 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 11:12:03,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:12:03 BoogieIcfgContainer [2022-04-08 11:12:03,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:12:03,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:12:03,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:12:03,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:12:03,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:12:02" (1/3) ... [2022-04-08 11:12:03,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aefeb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:12:03, skipping insertion in model container [2022-04-08 11:12:03,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:12:03" (2/3) ... [2022-04-08 11:12:03,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aefeb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:12:03, skipping insertion in model container [2022-04-08 11:12:03,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:12:03" (3/3) ... [2022-04-08 11:12:03,444 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-04-08 11:12:03,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:12:03,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:12:03,494 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:12:03,499 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 11:12:03,499 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:12:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 11:12:03,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:03,535 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:03,536 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-08 11:12:03,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:03,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1024403853] [2022-04-08 11:12:03,562 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:03,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-08 11:12:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:03,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004283904] [2022-04-08 11:12:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:12:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:03,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-08 11:12:03,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 11:12:03,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-08 11:12:03,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:12:03,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-08 11:12:03,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 11:12:03,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-08 11:12:03,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-08 11:12:03,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-08 11:12:03,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 11:12:03,767 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-08 11:12:03,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 11:12:03,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 11:12:03,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 11:12:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:12:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:03,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004283904] [2022-04-08 11:12:03,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004283904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:03,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:03,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:12:03,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:03,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1024403853] [2022-04-08 11:12:03,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1024403853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:03,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:03,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:12:03,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215926250] [2022-04-08 11:12:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:03,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 11:12:03,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:03,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:03,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:03,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:12:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:12:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:12:03,825 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,032 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-08 11:12:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:12:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 11:12:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 11:12:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 11:12:04,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-08 11:12:04,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:04,214 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:12:04,214 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:12:04,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:12:04,219 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:04,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:12:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 11:12:04,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:04,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:04,288 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:04,289 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,293 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-08 11:12:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-08 11:12:04,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:04,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:04,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-08 11:12:04,295 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-08 11:12:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,300 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-08 11:12:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-08 11:12:04,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:04,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:04,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:04,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-08 11:12:04,306 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-08 11:12:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:04,307 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-08 11:12:04,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-08 11:12:04,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-08 11:12:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:12:04,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:04,348 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:04,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:12:04,348 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-08 11:12:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:04,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1707295651] [2022-04-08 11:12:04,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-08 11:12:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:04,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417530116] [2022-04-08 11:12:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:12:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:04,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:12:04,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:12:04,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:12:04,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:12:04,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:12:04,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:12:04,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:12:04,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-08 11:12:04,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:12:04,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-08 11:12:04,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {263#false} is VALID [2022-04-08 11:12:04,419 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-08 11:12:04,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-08 11:12:04,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-08 11:12:04,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 11:12:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:12:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:04,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417530116] [2022-04-08 11:12:04,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417530116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:04,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:04,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:12:04,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:04,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1707295651] [2022-04-08 11:12:04,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1707295651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:04,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:04,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:12:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839097461] [2022-04-08 11:12:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 11:12:04,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:04,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:04,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:12:04,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:04,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:12:04,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:12:04,436 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,703 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-08 11:12:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:12:04,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 11:12:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 11:12:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 11:12:04,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-08 11:12:04,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:04,765 INFO L225 Difference]: With dead ends: 40 [2022-04-08 11:12:04,765 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 11:12:04,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:12:04,766 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:04,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 11:12:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 11:12:04,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:04,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:04,772 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:04,773 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,775 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 11:12:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:12:04,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:04,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:04,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-08 11:12:04,777 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-08 11:12:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:04,779 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 11:12:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:12:04,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:04,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:04,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:04,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-08 11:12:04,783 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-08 11:12:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:04,783 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-08 11:12:04,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-08 11:12:04,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:12:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:12:04,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:04,822 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:04,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 11:12:04,822 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:04,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-08 11:12:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:04,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117416402] [2022-04-08 11:12:04,824 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-08 11:12:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:04,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773828763] [2022-04-08 11:12:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:04,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:04,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:12:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:04,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-08 11:12:04,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 11:12:04,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-08 11:12:04,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:12:04,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-08 11:12:04,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 11:12:04,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-08 11:12:04,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-08 11:12:04,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 11:12:04,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 11:12:04,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 50);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 11:12:04,913 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:04,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:12:04,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-08 11:12:04,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-08 11:12:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:12:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:04,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773828763] [2022-04-08 11:12:04,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773828763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:04,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:04,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:12:04,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117416402] [2022-04-08 11:12:04,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117416402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:04,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:04,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:12:04,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182771543] [2022-04-08 11:12:04,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:04,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 11:12:04,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:04,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:04,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:04,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:12:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:12:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:12:04,928 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:05,264 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 11:12:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:12:05,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 11:12:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 11:12:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 11:12:05,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-08 11:12:05,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:05,317 INFO L225 Difference]: With dead ends: 34 [2022-04-08 11:12:05,318 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 11:12:05,318 INFO L912 BasicCegarLoop]: 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-08 11:12:05,319 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:05,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:05,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 11:12:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 11:12:05,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:05,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:05,326 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:05,327 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:05,330 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 11:12:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:12:05,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:05,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:05,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-08 11:12:05,331 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-08 11:12:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:05,333 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 11:12:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:12:05,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:05,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:05,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:05,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:12:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 11:12:05,337 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 11:12:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:05,337 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 11:12:05,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:12:05,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 11:12:05,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:12:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:12:05,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:05,382 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:05,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 11:12:05,382 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-08 11:12:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:05,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090808559] [2022-04-08 11:12:05,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-08 11:12:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:05,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334189569] [2022-04-08 11:12:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:05,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:05,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169185126] [2022-04-08 11:12:05,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:05,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:05,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:05,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:05,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 11:12:05,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:05,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:05,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:12:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:05,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:05,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-08 11:12:05,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {681#true} is VALID [2022-04-08 11:12:05,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-08 11:12:05,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-08 11:12:05,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-08 11:12:05,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:12:05,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:12:05,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:12:05,583 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-08 11:12:05,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-08 11:12:05,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-08 11:12:05,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-08 11:12:05,584 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:12:05,585 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:05,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:05,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-08 11:12:05,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-08 11:12:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:12:05,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:12:05,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:05,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334189569] [2022-04-08 11:12:05,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:05,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169185126] [2022-04-08 11:12:05,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169185126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:05,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:05,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:05,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:05,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090808559] [2022-04-08 11:12:05,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090808559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:05,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:05,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:05,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316624683] [2022-04-08 11:12:05,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:05,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 11:12:05,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:05,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:12:05,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:05,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:12:05,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:05,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:12:05,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:12:05,607 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:12:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:05,958 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-08 11:12:05,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:12:05,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 11:12:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:12:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:12:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:05,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:12:06,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:06,017 INFO L225 Difference]: With dead ends: 50 [2022-04-08 11:12:06,017 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 11:12:06,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:12:06,018 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:06,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:12:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 11:12:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-08 11:12:06,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:06,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:06,037 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:06,038 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:06,042 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-08 11:12:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-08 11:12:06,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:06,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:06,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-08 11:12:06,043 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-08 11:12:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:06,046 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-08 11:12:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-08 11:12:06,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:06,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:06,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:06,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-08 11:12:06,055 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-08 11:12:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:06,055 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-08 11:12:06,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:12:06,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-08 11:12:06,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-08 11:12:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 11:12:06,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:06,110 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:06,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 11:12:06,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:06,342 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-08 11:12:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:06,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761704181] [2022-04-08 11:12:06,347 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-08 11:12:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:06,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360292440] [2022-04-08 11:12:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:06,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:06,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734420282] [2022-04-08 11:12:06,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:06,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:06,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:06,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:06,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 11:12:06,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:06,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:06,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:12:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:06,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:06,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-08 11:12:06,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1010#true} is VALID [2022-04-08 11:12:06,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:12:06,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-08 11:12:06,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-08 11:12:06,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:12:06,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:12:06,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:12:06,505 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-08 11:12:06,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-08 11:12:06,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-08 11:12:06,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:12:06,506 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:12:06,506 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1010#true} is VALID [2022-04-08 11:12:06,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-08 11:12:06,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-08 11:12:06,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:12:06,510 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:12:06,511 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:06,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:06,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-08 11:12:06,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-08 11:12:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 11:12:06,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:12:06,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:06,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360292440] [2022-04-08 11:12:06,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:06,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734420282] [2022-04-08 11:12:06,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734420282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:06,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:06,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:06,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:06,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1761704181] [2022-04-08 11:12:06,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1761704181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:06,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:06,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220925223] [2022-04-08 11:12:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:06,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 11:12:06,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:06,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:12:06,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:06,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:12:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:12:06,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:12:06,528 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:12:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:06,804 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-08 11:12:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:12:06,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 11:12:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:12:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:12:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:06,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:12:06,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:06,875 INFO L225 Difference]: With dead ends: 54 [2022-04-08 11:12:06,875 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 11:12:06,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:12:06,878 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:06,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:12:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 11:12:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-08 11:12:06,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:06,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:06,899 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:06,900 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:06,904 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 11:12:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 11:12:06,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:06,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:06,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-08 11:12:06,906 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-08 11:12:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:06,909 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 11:12:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 11:12:06,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:06,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:06,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:06,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-08 11:12:06,913 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-08 11:12:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:06,913 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-08 11:12:06,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:12:06,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-08 11:12:06,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-08 11:12:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:12:06,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:06,976 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:06,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:07,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:07,192 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:07,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-08 11:12:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:07,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167076320] [2022-04-08 11:12:07,193 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-08 11:12:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:07,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278292569] [2022-04-08 11:12:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:07,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:07,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304520643] [2022-04-08 11:12:07,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:07,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:07,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:07,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:07,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 11:12:07,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:07,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:07,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:12:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:07,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:07,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-08 11:12:07,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#true} is VALID [2022-04-08 11:12:07,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:12:07,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-08 11:12:07,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-08 11:12:07,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:07,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:07,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:07,362 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-08 11:12:07,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:12:07,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:12:07,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:12:07,362 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:07,362 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1390#true} is VALID [2022-04-08 11:12:07,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:12:07,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:12:07,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:12:07,363 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:07,363 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-08 11:12:07,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:12:07,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:12:07,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:12:07,365 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:07,366 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:07,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:07,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-08 11:12:07,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-08 11:12:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 11:12:07,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:12:07,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:07,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278292569] [2022-04-08 11:12:07,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:07,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304520643] [2022-04-08 11:12:07,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304520643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:07,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:07,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:07,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:07,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167076320] [2022-04-08 11:12:07,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167076320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:07,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:07,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374986768] [2022-04-08 11:12:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 11:12:07,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:07,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:12:07,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:07,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:12:07,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:07,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:12:07,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:12:07,382 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:12:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:07,661 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-08 11:12:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:12:07,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 11:12:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:12:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:12:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:12:07,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:12:07,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:07,717 INFO L225 Difference]: With dead ends: 62 [2022-04-08 11:12:07,717 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 11:12:07,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:12:07,718 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:07,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 11:12:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 11:12:07,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:07,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:12:07,736 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:12:07,738 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:12:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:07,740 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-08 11:12:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:12:07,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:07,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:07,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-08 11:12:07,742 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-08 11:12:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:07,743 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-08 11:12:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:12:07,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:07,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:07,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:07,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:12:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-08 11:12:07,745 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-08 11:12:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:07,745 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-08 11:12:07,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:12:07,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-08 11:12:07,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:12:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:12:07,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:07,801 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:07,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 11:12:08,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:08,011 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-08 11:12:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:08,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [441781919] [2022-04-08 11:12:08,325 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:08,326 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-08 11:12:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:08,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765878109] [2022-04-08 11:12:08,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:08,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:08,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422705536] [2022-04-08 11:12:08,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:08,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:08,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:08,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:08,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 11:12:08,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:08,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:08,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:12:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:08,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:08,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-08 11:12:08,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:08,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:08,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:08,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:08,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:08,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,535 INFO L272 TraceCheckUtils]: 8: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,544 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,544 INFO L272 TraceCheckUtils]: 13: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,546 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,546 INFO L272 TraceCheckUtils]: 18: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,547 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,548 INFO L272 TraceCheckUtils]: 23: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,554 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,554 INFO L272 TraceCheckUtils]: 28: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,555 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {1825#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:08,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {1825#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1910#(<= |main_#t~post5| 1)} is VALID [2022-04-08 11:12:08,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1802#false} is VALID [2022-04-08 11:12:08,556 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-08 11:12:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 11:12:08,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:08,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-08 11:12:08,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-08 11:12:08,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:12:08,755 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-08 11:12:08,755 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-08 11:12:08,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:08,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:08,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:08,756 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:12:08,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1802#false} is VALID [2022-04-08 11:12:08,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {1972#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1968#(< |main_#t~post5| 50)} is VALID [2022-04-08 11:12:08,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {1972#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1972#(< ~counter~0 50)} is VALID [2022-04-08 11:12:08,757 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #67#return; {1972#(< ~counter~0 50)} is VALID [2022-04-08 11:12:08,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:08,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:08,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:08,758 INFO L272 TraceCheckUtils]: 28: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1801#true} is VALID [2022-04-08 11:12:08,759 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #65#return; {1972#(< ~counter~0 50)} is VALID [2022-04-08 11:12:08,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:08,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:08,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:08,759 INFO L272 TraceCheckUtils]: 23: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:12:08,760 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #63#return; {1972#(< ~counter~0 50)} is VALID [2022-04-08 11:12:08,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:08,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:08,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:08,760 INFO L272 TraceCheckUtils]: 18: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:12:08,761 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #61#return; {1972#(< ~counter~0 50)} is VALID [2022-04-08 11:12:08,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:08,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:08,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:08,761 INFO L272 TraceCheckUtils]: 13: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1801#true} is VALID [2022-04-08 11:12:08,762 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 50)} #59#return; {1972#(< ~counter~0 50)} is VALID [2022-04-08 11:12:08,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:12:08,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:12:08,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:12:08,762 INFO L272 TraceCheckUtils]: 8: Hoare triple {1972#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:12:08,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1972#(< ~counter~0 50)} is VALID [2022-04-08 11:12:08,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {2057#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1972#(< ~counter~0 50)} is VALID [2022-04-08 11:12:08,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#(< ~counter~0 49)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2057#(< ~counter~0 49)} is VALID [2022-04-08 11:12:08,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 49)} call #t~ret6 := main(); {2057#(< ~counter~0 49)} is VALID [2022-04-08 11:12:08,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 49)} {1801#true} #81#return; {2057#(< ~counter~0 49)} is VALID [2022-04-08 11:12:08,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 49)} assume true; {2057#(< ~counter~0 49)} is VALID [2022-04-08 11:12:08,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2057#(< ~counter~0 49)} is VALID [2022-04-08 11:12:08,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-08 11:12:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 11:12:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765878109] [2022-04-08 11:12:08,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422705536] [2022-04-08 11:12:08,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422705536] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:08,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:08,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 11:12:08,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [441781919] [2022-04-08 11:12:08,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [441781919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:08,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:08,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:12:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482400226] [2022-04-08 11:12:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-08 11:12:08,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:08,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:08,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:08,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:12:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:08,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:12:08,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:12:08,791 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:09,061 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-08 11:12:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:12:09,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-08 11:12:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 11:12:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 11:12:09,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-08 11:12:09,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:09,141 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:12:09,141 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 11:12:09,141 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:12:09,142 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:09,142 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:12:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 11:12:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 11:12:09,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:09,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:12:09,172 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:12:09,172 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:12:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:09,174 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:12:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:12:09,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:09,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:09,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-08 11:12:09,175 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-08 11:12:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:09,176 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:12:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:12:09,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:09,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:09,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:09,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:12:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 11:12:09,178 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-08 11:12:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:09,178 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 11:12:09,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:09,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 11:12:09,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:12:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:12:09,238 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:09,238 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:09,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 11:12:09,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:09,451 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-08 11:12:09,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:09,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [482532555] [2022-04-08 11:12:09,889 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:09,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-08 11:12:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:09,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507197291] [2022-04-08 11:12:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:09,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:09,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361706031] [2022-04-08 11:12:09,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:09,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:09,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:09,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:09,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 11:12:09,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:09,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:09,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:12:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:09,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:10,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-08 11:12:10,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2448#true} is VALID [2022-04-08 11:12:10,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-08 11:12:10,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-08 11:12:10,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:10,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:10,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:10,147 INFO L272 TraceCheckUtils]: 8: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,147 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:10,148 INFO L272 TraceCheckUtils]: 13: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,148 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:10,148 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,149 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:10,149 INFO L272 TraceCheckUtils]: 23: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,150 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:10,150 INFO L272 TraceCheckUtils]: 28: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,151 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:10,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:12:10,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:12:10,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:12:10,152 INFO L272 TraceCheckUtils]: 36: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,153 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:12:10,154 INFO L272 TraceCheckUtils]: 41: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:10,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:10,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-08 11:12:10,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-08 11:12:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 11:12:10,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:10,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-08 11:12:10,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-08 11:12:10,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:10,324 INFO L272 TraceCheckUtils]: 41: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:10,324 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:12:10,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,325 INFO L272 TraceCheckUtils]: 36: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 50);havoc #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:12:10,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:12:10,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:12:10,334 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #67#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:12:10,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,334 INFO L272 TraceCheckUtils]: 28: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,334 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #65#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:12:10,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,335 INFO L272 TraceCheckUtils]: 23: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,335 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #63#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:12:10,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,335 INFO L272 TraceCheckUtils]: 18: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,336 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #61#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:12:10,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,336 INFO L272 TraceCheckUtils]: 13: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,337 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #59#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:12:10,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:12:10,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:12:10,337 INFO L272 TraceCheckUtils]: 8: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:12:10,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:12:10,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:12:10,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:12:10,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-08 11:12:10,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-08 11:12:10,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:12:10,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2448#true} is VALID [2022-04-08 11:12:10,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-08 11:12:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 11:12:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507197291] [2022-04-08 11:12:10,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361706031] [2022-04-08 11:12:10,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361706031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:10,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:10,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 11:12:10,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [482532555] [2022-04-08 11:12:10,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [482532555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:10,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:10,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:12:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906069023] [2022-04-08 11:12:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:10,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-08 11:12:10,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:10,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:10,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:10,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:12:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:10,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:12:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:12:10,362 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:10,693 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-08 11:12:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:12:10,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-08 11:12:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-08 11:12:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-08 11:12:10,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-08 11:12:10,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:10,756 INFO L225 Difference]: With dead ends: 78 [2022-04-08 11:12:10,756 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 11:12:10,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:12:10,756 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:10,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:10,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 11:12:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-08 11:12:10,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:10,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:10,793 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:10,794 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:10,796 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 11:12:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-08 11:12:10,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:10,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:10,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-08 11:12:10,796 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-08 11:12:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:10,799 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 11:12:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-08 11:12:10,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:10,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:10,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:10,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-08 11:12:10,801 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-08 11:12:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:10,801 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-08 11:12:10,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:12:10,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-08 11:12:10,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-08 11:12:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:12:10,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:10,872 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:10,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:11,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:11,073 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-08 11:12:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:11,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [212692445] [2022-04-08 11:12:11,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:11,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-08 11:12:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:11,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088597185] [2022-04-08 11:12:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:11,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:11,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379873724] [2022-04-08 11:12:11,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:11,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:11,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:11,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:11,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 11:12:11,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:12:11,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:11,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 11:12:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:11,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:11,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-08 11:12:11,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#true} is VALID [2022-04-08 11:12:11,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:11,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 50);havoc #t~post5; {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:11,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:11,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:11,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:11,712 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #61#return; {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:12:11,713 INFO L272 TraceCheckUtils]: 18: Hoare triple {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:11,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:11,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:11,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:11,714 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:11,714 INFO L272 TraceCheckUtils]: 23: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:11,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:11,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:11,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:11,715 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3167#true} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:11,715 INFO L272 TraceCheckUtils]: 28: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:11,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:11,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:11,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:11,716 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:11,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-08 11:12:11,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-08 11:12:11,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 50);havoc #t~post5; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-08 11:12:11,724 INFO L272 TraceCheckUtils]: 36: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:11,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:11,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:11,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:11,727 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:11,727 INFO L272 TraceCheckUtils]: 41: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:11,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:11,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:11,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:11,729 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-08 11:12:11,729 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:11,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:11,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-08 11:12:11,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-08 11:12:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 11:12:11,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:12,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-08 11:12:12,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-08 11:12:12,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:12,215 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:12,215 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-08 11:12:12,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:12,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:12,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:12:12,216 INFO L272 TraceCheckUtils]: 41: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:12,217 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:12,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:12,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:12,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:12:12,218 INFO L272 TraceCheckUtils]: 36: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:12,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:12,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:12,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:12,224 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:12,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:12,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:12,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:12,225 INFO L272 TraceCheckUtils]: 28: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:12,225 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3167#true} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:12,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:12,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:12,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:12,226 INFO L272 TraceCheckUtils]: 23: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:12,226 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #63#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:12:12,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:12,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:12,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:12:12,227 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:12,227 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-08 11:12:12,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:12,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:12,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:12,227 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:12,227 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 50);havoc #t~post5; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-08 11:12:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 11:12:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088597185] [2022-04-08 11:12:12,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379873724] [2022-04-08 11:12:12,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379873724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:12,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:12,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-08 11:12:12,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [212692445] [2022-04-08 11:12:12,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [212692445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:12,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:12,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:12:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790960980] [2022-04-08 11:12:12,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:12,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-08 11:12:12,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:12,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:12:12,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:12,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:12:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:12:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:12:12,261 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:12:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:16,858 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-04-08 11:12:16,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:12:16,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-08 11:12:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:12:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 11:12:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:12:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 11:12:16,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 11:12:18,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:18,197 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:12:18,197 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 11:12:18,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-08 11:12:18,198 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:18,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 11:12:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 11:12:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 11:12:18,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:18,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 11:12:18,246 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 11:12:18,246 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 11:12:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:18,248 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-08 11:12:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:12:18,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:18,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:18,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-04-08 11:12:18,248 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-04-08 11:12:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:18,250 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-08 11:12:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:12:18,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:18,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:18,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:18,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 11:12:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-08 11:12:18,252 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 50 [2022-04-08 11:12:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:18,252 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-08 11:12:18,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:12:18,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-08 11:12:20,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:12:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 11:12:20,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:20,339 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:20,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:20,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:20,539 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-08 11:12:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:20,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [326033436] [2022-04-08 11:12:20,796 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:20,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-08 11:12:20,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:20,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864938568] [2022-04-08 11:12:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:20,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:20,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496143918] [2022-04-08 11:12:20,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:20,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:20,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:20,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 11:12:20,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:20,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:20,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 11:12:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:20,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:21,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {3898#true} call ULTIMATE.init(); {3898#true} is VALID [2022-04-08 11:12:21,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {3898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3898#true} is VALID [2022-04-08 11:12:21,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3898#true} {3898#true} #81#return; {3898#true} is VALID [2022-04-08 11:12:21,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {3898#true} call #t~ret6 := main(); {3898#true} is VALID [2022-04-08 11:12:21,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {3898#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:21,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:21,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:21,289 INFO L272 TraceCheckUtils]: 8: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,290 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:21,290 INFO L272 TraceCheckUtils]: 13: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,291 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:21,291 INFO L272 TraceCheckUtils]: 18: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,291 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:21,291 INFO L272 TraceCheckUtils]: 23: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,292 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:21,292 INFO L272 TraceCheckUtils]: 28: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,293 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3898#true} {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:21,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {3918#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:21,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:21,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:21,294 INFO L272 TraceCheckUtils]: 36: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,294 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #59#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:21,295 INFO L272 TraceCheckUtils]: 41: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,295 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #61#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:21,295 INFO L272 TraceCheckUtils]: 46: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,295 INFO L290 TraceCheckUtils]: 47: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,296 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #63#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:21,296 INFO L272 TraceCheckUtils]: 51: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,297 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #65#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:21,297 INFO L272 TraceCheckUtils]: 56: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,297 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3898#true} {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #67#return; {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:21,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {4003#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-08 11:12:21,298 INFO L272 TraceCheckUtils]: 62: Hoare triple {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3898#true} is VALID [2022-04-08 11:12:21,298 INFO L290 TraceCheckUtils]: 63: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-08 11:12:21,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-08 11:12:21,298 INFO L290 TraceCheckUtils]: 65: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-08 11:12:21,299 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3898#true} {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-08 11:12:21,299 INFO L272 TraceCheckUtils]: 67: Hoare triple {4088#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:21,299 INFO L290 TraceCheckUtils]: 68: Hoare triple {4107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:21,300 INFO L290 TraceCheckUtils]: 69: Hoare triple {4111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3899#false} is VALID [2022-04-08 11:12:21,300 INFO L290 TraceCheckUtils]: 70: Hoare triple {3899#false} assume !false; {3899#false} is VALID [2022-04-08 11:12:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 11:12:21,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:21,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864938568] [2022-04-08 11:12:21,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496143918] [2022-04-08 11:12:21,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496143918] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:12:21,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:12:21,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 11:12:21,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:21,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [326033436] [2022-04-08 11:12:21,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [326033436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:21,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:21,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:12:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793120622] [2022-04-08 11:12:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:21,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-08 11:12:21,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:21,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:21,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:21,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:12:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:12:21,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:12:21,668 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:22,062 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-04-08 11:12:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:12:22,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-08 11:12:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:12:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:12:22,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 11:12:22,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:22,139 INFO L225 Difference]: With dead ends: 84 [2022-04-08 11:12:22,139 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 11:12:22,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:12:22,140 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:22,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 11:12:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-08 11:12:22,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:22,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:12:22,197 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:12:22,197 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:12:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:22,199 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-08 11:12:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-08 11:12:22,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:22,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:22,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 82 states. [2022-04-08 11:12:22,200 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 82 states. [2022-04-08 11:12:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:22,201 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-08 11:12:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-08 11:12:22,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:22,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:22,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:22,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:12:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-04-08 11:12:22,203 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 71 [2022-04-08 11:12:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:22,203 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-04-08 11:12:22,203 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:22,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 92 transitions. [2022-04-08 11:12:22,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-08 11:12:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 11:12:22,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:22,318 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:22,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:22,518 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:22,519 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-08 11:12:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:22,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729571538] [2022-04-08 11:12:22,774 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:22,774 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-08 11:12:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:22,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688487546] [2022-04-08 11:12:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:22,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:22,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989873655] [2022-04-08 11:12:22,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:22,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:22,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:22,795 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:22,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 11:12:22,837 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:12:22,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:22,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:12:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:22,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:23,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2022-04-08 11:12:23,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {4735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4743#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:23,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {4743#(<= ~counter~0 0)} assume true; {4743#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:23,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4743#(<= ~counter~0 0)} {4735#true} #81#return; {4743#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:23,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {4743#(<= ~counter~0 0)} call #t~ret6 := main(); {4743#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:23,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {4743#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4743#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:23,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {4743#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {4759#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,085 INFO L272 TraceCheckUtils]: 8: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,086 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #59#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,086 INFO L272 TraceCheckUtils]: 13: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,087 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #61#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,087 INFO L272 TraceCheckUtils]: 18: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,088 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #63#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,088 INFO L272 TraceCheckUtils]: 23: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,089 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #65#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,089 INFO L272 TraceCheckUtils]: 28: Hoare triple {4759#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {4759#(<= ~counter~0 1)} ~cond := #in~cond; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {4759#(<= ~counter~0 1)} assume !(0 == ~cond); {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {4759#(<= ~counter~0 1)} assume true; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,090 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4759#(<= ~counter~0 1)} {4759#(<= ~counter~0 1)} #67#return; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {4759#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4759#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:23,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {4759#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {4844#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,091 INFO L272 TraceCheckUtils]: 36: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,092 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #59#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,092 INFO L272 TraceCheckUtils]: 41: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,096 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #61#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,096 INFO L272 TraceCheckUtils]: 46: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,097 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #63#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,098 INFO L272 TraceCheckUtils]: 51: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,098 INFO L290 TraceCheckUtils]: 52: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,098 INFO L290 TraceCheckUtils]: 53: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,098 INFO L290 TraceCheckUtils]: 54: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,098 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #65#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,099 INFO L272 TraceCheckUtils]: 56: Hoare triple {4844#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,099 INFO L290 TraceCheckUtils]: 57: Hoare triple {4844#(<= ~counter~0 2)} ~cond := #in~cond; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,099 INFO L290 TraceCheckUtils]: 58: Hoare triple {4844#(<= ~counter~0 2)} assume !(0 == ~cond); {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,099 INFO L290 TraceCheckUtils]: 59: Hoare triple {4844#(<= ~counter~0 2)} assume true; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,099 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4844#(<= ~counter~0 2)} {4844#(<= ~counter~0 2)} #67#return; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,100 INFO L290 TraceCheckUtils]: 61: Hoare triple {4844#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4844#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:23,100 INFO L290 TraceCheckUtils]: 62: Hoare triple {4844#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4929#(<= |main_#t~post5| 2)} is VALID [2022-04-08 11:12:23,100 INFO L290 TraceCheckUtils]: 63: Hoare triple {4929#(<= |main_#t~post5| 2)} assume !(#t~post5 < 50);havoc #t~post5; {4736#false} is VALID [2022-04-08 11:12:23,100 INFO L272 TraceCheckUtils]: 64: Hoare triple {4736#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4736#false} is VALID [2022-04-08 11:12:23,100 INFO L290 TraceCheckUtils]: 65: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-08 11:12:23,100 INFO L290 TraceCheckUtils]: 66: Hoare triple {4736#false} assume !(0 == ~cond); {4736#false} is VALID [2022-04-08 11:12:23,100 INFO L290 TraceCheckUtils]: 67: Hoare triple {4736#false} assume true; {4736#false} is VALID [2022-04-08 11:12:23,100 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4736#false} {4736#false} #69#return; {4736#false} is VALID [2022-04-08 11:12:23,100 INFO L272 TraceCheckUtils]: 69: Hoare triple {4736#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4736#false} is VALID [2022-04-08 11:12:23,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-08 11:12:23,101 INFO L290 TraceCheckUtils]: 71: Hoare triple {4736#false} assume 0 == ~cond; {4736#false} is VALID [2022-04-08 11:12:23,101 INFO L290 TraceCheckUtils]: 72: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2022-04-08 11:12:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 60 proven. 112 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-08 11:12:23,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:23,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2022-04-08 11:12:23,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {4736#false} assume 0 == ~cond; {4736#false} is VALID [2022-04-08 11:12:23,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2022-04-08 11:12:23,254 INFO L272 TraceCheckUtils]: 69: Hoare triple {4736#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4736#false} is VALID [2022-04-08 11:12:23,254 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4735#true} {4736#false} #69#return; {4736#false} is VALID [2022-04-08 11:12:23,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,254 INFO L290 TraceCheckUtils]: 66: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,255 INFO L272 TraceCheckUtils]: 64: Hoare triple {4736#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {4987#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {4736#false} is VALID [2022-04-08 11:12:23,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {4991#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4987#(< |main_#t~post5| 50)} is VALID [2022-04-08 11:12:23,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {4991#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4991#(< ~counter~0 50)} is VALID [2022-04-08 11:12:23,255 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #67#return; {4991#(< ~counter~0 50)} is VALID [2022-04-08 11:12:23,256 INFO L290 TraceCheckUtils]: 59: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,256 INFO L290 TraceCheckUtils]: 58: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,256 INFO L272 TraceCheckUtils]: 56: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,256 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #65#return; {4991#(< ~counter~0 50)} is VALID [2022-04-08 11:12:23,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,256 INFO L272 TraceCheckUtils]: 51: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,257 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #63#return; {4991#(< ~counter~0 50)} is VALID [2022-04-08 11:12:23,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,257 INFO L290 TraceCheckUtils]: 48: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,257 INFO L290 TraceCheckUtils]: 47: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,257 INFO L272 TraceCheckUtils]: 46: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,257 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #61#return; {4991#(< ~counter~0 50)} is VALID [2022-04-08 11:12:23,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,257 INFO L272 TraceCheckUtils]: 41: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,258 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4735#true} {4991#(< ~counter~0 50)} #59#return; {4991#(< ~counter~0 50)} is VALID [2022-04-08 11:12:23,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,258 INFO L272 TraceCheckUtils]: 36: Hoare triple {4991#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {4991#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {4991#(< ~counter~0 50)} is VALID [2022-04-08 11:12:23,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {5076#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4991#(< ~counter~0 50)} is VALID [2022-04-08 11:12:23,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {5076#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5076#(< ~counter~0 49)} is VALID [2022-04-08 11:12:23,259 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #67#return; {5076#(< ~counter~0 49)} is VALID [2022-04-08 11:12:23,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,259 INFO L272 TraceCheckUtils]: 28: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,259 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #65#return; {5076#(< ~counter~0 49)} is VALID [2022-04-08 11:12:23,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,260 INFO L272 TraceCheckUtils]: 23: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,260 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #63#return; {5076#(< ~counter~0 49)} is VALID [2022-04-08 11:12:23,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,260 INFO L272 TraceCheckUtils]: 18: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,260 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #61#return; {5076#(< ~counter~0 49)} is VALID [2022-04-08 11:12:23,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,261 INFO L272 TraceCheckUtils]: 13: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,261 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4735#true} {5076#(< ~counter~0 49)} #59#return; {5076#(< ~counter~0 49)} is VALID [2022-04-08 11:12:23,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {4735#true} assume true; {4735#true} is VALID [2022-04-08 11:12:23,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {4735#true} assume !(0 == ~cond); {4735#true} is VALID [2022-04-08 11:12:23,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {4735#true} ~cond := #in~cond; {4735#true} is VALID [2022-04-08 11:12:23,261 INFO L272 TraceCheckUtils]: 8: Hoare triple {5076#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4735#true} is VALID [2022-04-08 11:12:23,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {5076#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {5076#(< ~counter~0 49)} is VALID [2022-04-08 11:12:23,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {5161#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5076#(< ~counter~0 49)} is VALID [2022-04-08 11:12:23,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#(< ~counter~0 48)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5161#(< ~counter~0 48)} is VALID [2022-04-08 11:12:23,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#(< ~counter~0 48)} call #t~ret6 := main(); {5161#(< ~counter~0 48)} is VALID [2022-04-08 11:12:23,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#(< ~counter~0 48)} {4735#true} #81#return; {5161#(< ~counter~0 48)} is VALID [2022-04-08 11:12:23,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#(< ~counter~0 48)} assume true; {5161#(< ~counter~0 48)} is VALID [2022-04-08 11:12:23,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {4735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5161#(< ~counter~0 48)} is VALID [2022-04-08 11:12:23,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2022-04-08 11:12:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 11:12:23,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:23,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688487546] [2022-04-08 11:12:23,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:23,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989873655] [2022-04-08 11:12:23,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989873655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:23,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:23,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:12:23,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:23,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729571538] [2022-04-08 11:12:23,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729571538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:23,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:23,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:12:23,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175931390] [2022-04-08 11:12:23,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:23,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-08 11:12:23,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:23,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:23,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:23,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:12:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:23,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:12:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:12:23,291 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:23,717 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-08 11:12:23,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:12:23,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-08 11:12:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 11:12:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 11:12:23,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-08 11:12:23,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:23,788 INFO L225 Difference]: With dead ends: 111 [2022-04-08 11:12:23,788 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 11:12:23,789 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:12:23,789 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:23,789 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:12:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 11:12:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-08 11:12:23,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:23,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:12:23,852 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:12:23,853 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:12:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:23,855 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:12:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:12:23,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:23,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:23,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 96 states. [2022-04-08 11:12:23,856 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 96 states. [2022-04-08 11:12:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:23,858 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:12:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:12:23,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:23,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:23,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:23,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:12:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-04-08 11:12:23,861 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 73 [2022-04-08 11:12:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:23,863 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-04-08 11:12:23,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:12:23,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 103 transitions. [2022-04-08 11:12:24,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-04-08 11:12:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 11:12:24,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:24,042 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:24,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:24,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 11:12:24,258 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-08 11:12:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:24,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487446806] [2022-04-08 11:12:24,517 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:24,517 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-08 11:12:24,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:24,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099722134] [2022-04-08 11:12:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:24,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:24,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608742895] [2022-04-08 11:12:24,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:24,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:24,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:24,534 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:24,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 11:12:24,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:24,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:24,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:12:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:24,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:25,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {5788#true} call ULTIMATE.init(); {5788#true} is VALID [2022-04-08 11:12:25,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {5788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5788#true} is VALID [2022-04-08 11:12:25,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5788#true} {5788#true} #81#return; {5788#true} is VALID [2022-04-08 11:12:25,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {5788#true} call #t~ret6 := main(); {5788#true} is VALID [2022-04-08 11:12:25,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {5788#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,106 INFO L272 TraceCheckUtils]: 8: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,107 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,107 INFO L272 TraceCheckUtils]: 13: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,107 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,108 INFO L272 TraceCheckUtils]: 18: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,108 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,108 INFO L272 TraceCheckUtils]: 23: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,109 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,109 INFO L272 TraceCheckUtils]: 28: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,109 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5788#true} {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:12:25,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {5808#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:25,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:25,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:25,112 INFO L272 TraceCheckUtils]: 36: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,112 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:25,112 INFO L272 TraceCheckUtils]: 41: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,113 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:25,113 INFO L272 TraceCheckUtils]: 46: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,115 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:25,115 INFO L272 TraceCheckUtils]: 51: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,116 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:25,116 INFO L272 TraceCheckUtils]: 56: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,116 INFO L290 TraceCheckUtils]: 58: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,117 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5788#true} {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:12:25,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {5893#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-08 11:12:25,117 INFO L272 TraceCheckUtils]: 62: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,118 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5788#true} {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-08 11:12:25,118 INFO L272 TraceCheckUtils]: 67: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5788#true} is VALID [2022-04-08 11:12:25,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {5788#true} ~cond := #in~cond; {5788#true} is VALID [2022-04-08 11:12:25,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {5788#true} assume !(0 == ~cond); {5788#true} is VALID [2022-04-08 11:12:25,118 INFO L290 TraceCheckUtils]: 70: Hoare triple {5788#true} assume true; {5788#true} is VALID [2022-04-08 11:12:25,118 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5788#true} {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-08 11:12:25,119 INFO L272 TraceCheckUtils]: 72: Hoare triple {5978#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:25,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {6012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:25,120 INFO L290 TraceCheckUtils]: 74: Hoare triple {6016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5789#false} is VALID [2022-04-08 11:12:25,120 INFO L290 TraceCheckUtils]: 75: Hoare triple {5789#false} assume !false; {5789#false} is VALID [2022-04-08 11:12:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 11:12:25,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099722134] [2022-04-08 11:12:37,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608742895] [2022-04-08 11:12:37,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608742895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:12:37,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:12:37,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 11:12:37,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487446806] [2022-04-08 11:12:37,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487446806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:37,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:37,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:12:37,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349348127] [2022-04-08 11:12:37,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:37,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-08 11:12:37,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:37,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:12:37,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:37,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:12:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:12:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:12:37,269 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:12:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:37,702 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:12:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:12:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-08 11:12:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:12:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:12:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:12:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:12:37,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 11:12:37,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:37,759 INFO L225 Difference]: With dead ends: 96 [2022-04-08 11:12:37,759 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 11:12:37,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:12:37,760 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:37,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:12:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 11:12:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 11:12:37,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:37,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:37,834 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:37,834 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:37,835 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-08 11:12:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:12:37,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:37,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:37,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 85 states. [2022-04-08 11:12:37,836 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 85 states. [2022-04-08 11:12:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:37,837 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-08 11:12:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:12:37,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:37,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:37,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:37,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-04-08 11:12:37,840 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 76 [2022-04-08 11:12:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:37,840 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-04-08 11:12:37,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:12:37,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 92 transitions. [2022-04-08 11:12:37,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:12:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 11:12:37,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:37,994 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:38,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 11:12:38,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:38,195 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:38,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-08 11:12:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:38,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754049847] [2022-04-08 11:12:38,430 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:38,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-08 11:12:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:38,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088047451] [2022-04-08 11:12:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:38,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:38,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312232075] [2022-04-08 11:12:38,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:38,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:38,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:38,459 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:38,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 11:12:38,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:12:38,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:38,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 11:12:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:38,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:39,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {6693#true} call ULTIMATE.init(); {6693#true} is VALID [2022-04-08 11:12:39,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {6693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6693#true} is VALID [2022-04-08 11:12:39,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6693#true} {6693#true} #81#return; {6693#true} is VALID [2022-04-08 11:12:39,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {6693#true} call #t~ret6 := main(); {6693#true} is VALID [2022-04-08 11:12:39,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {6693#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:39,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:39,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:39,229 INFO L272 TraceCheckUtils]: 8: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,229 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:39,230 INFO L272 TraceCheckUtils]: 13: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,230 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:39,230 INFO L272 TraceCheckUtils]: 18: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,243 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:39,243 INFO L272 TraceCheckUtils]: 23: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,244 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:39,244 INFO L272 TraceCheckUtils]: 28: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,244 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6693#true} {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:12:39,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {6713#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:12:39,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:12:39,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:12:39,246 INFO L272 TraceCheckUtils]: 36: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,246 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #59#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:12:39,246 INFO L272 TraceCheckUtils]: 41: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,247 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #61#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:12:39,247 INFO L272 TraceCheckUtils]: 46: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,248 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #63#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:12:39,248 INFO L272 TraceCheckUtils]: 51: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {6693#true} ~cond := #in~cond; {6856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:39,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {6856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:39,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:39,249 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6860#(not (= |__VERIFIER_assert_#in~cond| 0))} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #65#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:12:39,249 INFO L272 TraceCheckUtils]: 56: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,250 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6693#true} {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #67#return; {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:12:39,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {6798#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:12:39,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:12:39,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:12:39,251 INFO L272 TraceCheckUtils]: 64: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,251 INFO L290 TraceCheckUtils]: 65: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,252 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #59#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:12:39,252 INFO L272 TraceCheckUtils]: 69: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,252 INFO L290 TraceCheckUtils]: 71: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,252 INFO L290 TraceCheckUtils]: 72: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,253 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #61#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:12:39,253 INFO L272 TraceCheckUtils]: 74: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,253 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #63#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:12:39,253 INFO L272 TraceCheckUtils]: 79: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,254 INFO L290 TraceCheckUtils]: 80: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,254 INFO L290 TraceCheckUtils]: 81: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,254 INFO L290 TraceCheckUtils]: 82: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,254 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #65#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:12:39,254 INFO L272 TraceCheckUtils]: 84: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,254 INFO L290 TraceCheckUtils]: 85: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,254 INFO L290 TraceCheckUtils]: 86: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,254 INFO L290 TraceCheckUtils]: 87: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,255 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6693#true} {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #67#return; {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:12:39,255 INFO L290 TraceCheckUtils]: 89: Hoare triple {6885#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !(~n~0 <= ~a~0); {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-08 11:12:39,256 INFO L272 TraceCheckUtils]: 90: Hoare triple {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6693#true} is VALID [2022-04-08 11:12:39,256 INFO L290 TraceCheckUtils]: 91: Hoare triple {6693#true} ~cond := #in~cond; {6693#true} is VALID [2022-04-08 11:12:39,256 INFO L290 TraceCheckUtils]: 92: Hoare triple {6693#true} assume !(0 == ~cond); {6693#true} is VALID [2022-04-08 11:12:39,256 INFO L290 TraceCheckUtils]: 93: Hoare triple {6693#true} assume true; {6693#true} is VALID [2022-04-08 11:12:39,256 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6693#true} {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} #69#return; {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-08 11:12:39,257 INFO L272 TraceCheckUtils]: 95: Hoare triple {6970#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6989#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:39,257 INFO L290 TraceCheckUtils]: 96: Hoare triple {6989#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6993#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:39,257 INFO L290 TraceCheckUtils]: 97: Hoare triple {6993#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6694#false} is VALID [2022-04-08 11:12:39,258 INFO L290 TraceCheckUtils]: 98: Hoare triple {6694#false} assume !false; {6694#false} is VALID [2022-04-08 11:12:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 55 proven. 46 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-08 11:12:39,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:39,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:39,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088047451] [2022-04-08 11:12:39,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:39,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312232075] [2022-04-08 11:12:39,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312232075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:12:39,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:12:39,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 11:12:39,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:39,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754049847] [2022-04-08 11:12:39,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754049847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:39,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:39,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:12:39,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122437321] [2022-04-08 11:12:39,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-08 11:12:39,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:39,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:39,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:39,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:12:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:39,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:12:39,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:12:39,629 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:40,820 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-08 11:12:40,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:12:40,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-08 11:12:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 11:12:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 11:12:40,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-08 11:12:40,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:40,893 INFO L225 Difference]: With dead ends: 100 [2022-04-08 11:12:40,893 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 11:12:40,893 INFO L912 BasicCegarLoop]: 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-08 11:12:40,894 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:40,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:12:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 11:12:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-08 11:12:40,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:40,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:12:40,979 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:12:40,979 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:12:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:40,980 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-08 11:12:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-08 11:12:40,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:40,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:40,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 98 states. [2022-04-08 11:12:40,981 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 98 states. [2022-04-08 11:12:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:40,983 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-08 11:12:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-08 11:12:40,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:40,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:40,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:40,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:12:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-04-08 11:12:40,985 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 99 [2022-04-08 11:12:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:40,985 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-04-08 11:12:40,985 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:40,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 111 transitions. [2022-04-08 11:12:41,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-08 11:12:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 11:12:41,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:41,131 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:41,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:41,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 11:12:41,331 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:41,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:41,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-08 11:12:41,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:41,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330140346] [2022-04-08 11:12:41,549 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:41,550 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-08 11:12:41,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:41,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567759220] [2022-04-08 11:12:41,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:41,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:41,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:41,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410845518] [2022-04-08 11:12:41,559 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:12:41,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:41,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:41,560 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:41,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 11:12:41,784 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 11:12:41,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:41,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:12:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:41,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:42,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2022-04-08 11:12:42,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7723#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:42,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#(<= ~counter~0 0)} assume true; {7723#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:42,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#(<= ~counter~0 0)} {7715#true} #81#return; {7723#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:42,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {7723#(<= ~counter~0 0)} call #t~ret6 := main(); {7723#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:42,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7723#(<= ~counter~0 0)} is VALID [2022-04-08 11:12:42,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {7723#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {7739#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,197 INFO L272 TraceCheckUtils]: 8: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,199 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #59#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,199 INFO L272 TraceCheckUtils]: 13: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,200 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #61#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,201 INFO L272 TraceCheckUtils]: 18: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,202 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #63#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,203 INFO L272 TraceCheckUtils]: 23: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,204 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #65#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,204 INFO L272 TraceCheckUtils]: 28: Hoare triple {7739#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {7739#(<= ~counter~0 1)} ~cond := #in~cond; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {7739#(<= ~counter~0 1)} assume !(0 == ~cond); {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {7739#(<= ~counter~0 1)} assume true; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,206 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7739#(<= ~counter~0 1)} {7739#(<= ~counter~0 1)} #67#return; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {7739#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7739#(<= ~counter~0 1)} is VALID [2022-04-08 11:12:42,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {7739#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {7824#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,207 INFO L272 TraceCheckUtils]: 36: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,208 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #59#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,209 INFO L272 TraceCheckUtils]: 41: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,210 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #61#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,210 INFO L272 TraceCheckUtils]: 46: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,212 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #63#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,212 INFO L272 TraceCheckUtils]: 51: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,214 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #65#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,214 INFO L272 TraceCheckUtils]: 56: Hoare triple {7824#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {7824#(<= ~counter~0 2)} ~cond := #in~cond; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {7824#(<= ~counter~0 2)} assume !(0 == ~cond); {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {7824#(<= ~counter~0 2)} assume true; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,216 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7824#(<= ~counter~0 2)} {7824#(<= ~counter~0 2)} #67#return; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {7824#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7824#(<= ~counter~0 2)} is VALID [2022-04-08 11:12:42,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {7824#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {7909#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,217 INFO L272 TraceCheckUtils]: 64: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,218 INFO L290 TraceCheckUtils]: 65: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,218 INFO L290 TraceCheckUtils]: 66: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,219 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #59#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,219 INFO L272 TraceCheckUtils]: 69: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,220 INFO L290 TraceCheckUtils]: 70: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,220 INFO L290 TraceCheckUtils]: 71: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,220 INFO L290 TraceCheckUtils]: 72: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,221 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #61#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,221 INFO L272 TraceCheckUtils]: 74: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,222 INFO L290 TraceCheckUtils]: 75: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,222 INFO L290 TraceCheckUtils]: 76: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,222 INFO L290 TraceCheckUtils]: 77: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,223 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #63#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,223 INFO L272 TraceCheckUtils]: 79: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,224 INFO L290 TraceCheckUtils]: 81: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,224 INFO L290 TraceCheckUtils]: 82: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,225 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #65#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,225 INFO L272 TraceCheckUtils]: 84: Hoare triple {7909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,226 INFO L290 TraceCheckUtils]: 85: Hoare triple {7909#(<= ~counter~0 3)} ~cond := #in~cond; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,226 INFO L290 TraceCheckUtils]: 86: Hoare triple {7909#(<= ~counter~0 3)} assume !(0 == ~cond); {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,226 INFO L290 TraceCheckUtils]: 87: Hoare triple {7909#(<= ~counter~0 3)} assume true; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,227 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7909#(<= ~counter~0 3)} {7909#(<= ~counter~0 3)} #67#return; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,227 INFO L290 TraceCheckUtils]: 89: Hoare triple {7909#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7909#(<= ~counter~0 3)} is VALID [2022-04-08 11:12:42,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {7909#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7994#(<= |main_#t~post5| 3)} is VALID [2022-04-08 11:12:42,228 INFO L290 TraceCheckUtils]: 91: Hoare triple {7994#(<= |main_#t~post5| 3)} assume !(#t~post5 < 50);havoc #t~post5; {7716#false} is VALID [2022-04-08 11:12:42,228 INFO L272 TraceCheckUtils]: 92: Hoare triple {7716#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7716#false} is VALID [2022-04-08 11:12:42,228 INFO L290 TraceCheckUtils]: 93: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-08 11:12:42,228 INFO L290 TraceCheckUtils]: 94: Hoare triple {7716#false} assume !(0 == ~cond); {7716#false} is VALID [2022-04-08 11:12:42,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {7716#false} assume true; {7716#false} is VALID [2022-04-08 11:12:42,228 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7716#false} {7716#false} #69#return; {7716#false} is VALID [2022-04-08 11:12:42,228 INFO L272 TraceCheckUtils]: 97: Hoare triple {7716#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7716#false} is VALID [2022-04-08 11:12:42,228 INFO L290 TraceCheckUtils]: 98: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-08 11:12:42,228 INFO L290 TraceCheckUtils]: 99: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-08 11:12:42,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-08 11:12:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 90 proven. 330 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-08 11:12:42,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:42,618 INFO L290 TraceCheckUtils]: 100: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2022-04-08 11:12:42,619 INFO L290 TraceCheckUtils]: 99: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2022-04-08 11:12:42,619 INFO L290 TraceCheckUtils]: 98: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2022-04-08 11:12:42,619 INFO L272 TraceCheckUtils]: 97: Hoare triple {7716#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7716#false} is VALID [2022-04-08 11:12:42,619 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7715#true} {7716#false} #69#return; {7716#false} is VALID [2022-04-08 11:12:42,619 INFO L290 TraceCheckUtils]: 95: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,619 INFO L290 TraceCheckUtils]: 94: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,619 INFO L290 TraceCheckUtils]: 93: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,619 INFO L272 TraceCheckUtils]: 92: Hoare triple {7716#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,619 INFO L290 TraceCheckUtils]: 91: Hoare triple {8052#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {7716#false} is VALID [2022-04-08 11:12:42,620 INFO L290 TraceCheckUtils]: 90: Hoare triple {8056#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8052#(< |main_#t~post5| 50)} is VALID [2022-04-08 11:12:42,620 INFO L290 TraceCheckUtils]: 89: Hoare triple {8056#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8056#(< ~counter~0 50)} is VALID [2022-04-08 11:12:42,620 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #67#return; {8056#(< ~counter~0 50)} is VALID [2022-04-08 11:12:42,620 INFO L290 TraceCheckUtils]: 87: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,620 INFO L290 TraceCheckUtils]: 86: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,620 INFO L290 TraceCheckUtils]: 85: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,620 INFO L272 TraceCheckUtils]: 84: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,621 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #65#return; {8056#(< ~counter~0 50)} is VALID [2022-04-08 11:12:42,621 INFO L290 TraceCheckUtils]: 82: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,621 INFO L290 TraceCheckUtils]: 81: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,621 INFO L290 TraceCheckUtils]: 80: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,621 INFO L272 TraceCheckUtils]: 79: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,621 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #63#return; {8056#(< ~counter~0 50)} is VALID [2022-04-08 11:12:42,621 INFO L290 TraceCheckUtils]: 77: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,622 INFO L290 TraceCheckUtils]: 75: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,622 INFO L272 TraceCheckUtils]: 74: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,622 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #61#return; {8056#(< ~counter~0 50)} is VALID [2022-04-08 11:12:42,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,622 INFO L290 TraceCheckUtils]: 70: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,622 INFO L272 TraceCheckUtils]: 69: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,622 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7715#true} {8056#(< ~counter~0 50)} #59#return; {8056#(< ~counter~0 50)} is VALID [2022-04-08 11:12:42,623 INFO L290 TraceCheckUtils]: 67: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,623 INFO L272 TraceCheckUtils]: 64: Hoare triple {8056#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {8056#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {8056#(< ~counter~0 50)} is VALID [2022-04-08 11:12:42,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {8141#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8056#(< ~counter~0 50)} is VALID [2022-04-08 11:12:42,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {8141#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8141#(< ~counter~0 49)} is VALID [2022-04-08 11:12:42,624 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #67#return; {8141#(< ~counter~0 49)} is VALID [2022-04-08 11:12:42,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,624 INFO L272 TraceCheckUtils]: 56: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,625 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #65#return; {8141#(< ~counter~0 49)} is VALID [2022-04-08 11:12:42,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,625 INFO L272 TraceCheckUtils]: 51: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,625 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #63#return; {8141#(< ~counter~0 49)} is VALID [2022-04-08 11:12:42,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,625 INFO L290 TraceCheckUtils]: 47: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,625 INFO L272 TraceCheckUtils]: 46: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,626 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #61#return; {8141#(< ~counter~0 49)} is VALID [2022-04-08 11:12:42,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,626 INFO L272 TraceCheckUtils]: 41: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,626 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7715#true} {8141#(< ~counter~0 49)} #59#return; {8141#(< ~counter~0 49)} is VALID [2022-04-08 11:12:42,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,626 INFO L272 TraceCheckUtils]: 36: Hoare triple {8141#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {8141#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {8141#(< ~counter~0 49)} is VALID [2022-04-08 11:12:42,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {8226#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8141#(< ~counter~0 49)} is VALID [2022-04-08 11:12:42,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {8226#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8226#(< ~counter~0 48)} is VALID [2022-04-08 11:12:42,628 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #67#return; {8226#(< ~counter~0 48)} is VALID [2022-04-08 11:12:42,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,628 INFO L272 TraceCheckUtils]: 28: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,629 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #65#return; {8226#(< ~counter~0 48)} is VALID [2022-04-08 11:12:42,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,629 INFO L272 TraceCheckUtils]: 23: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,629 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #63#return; {8226#(< ~counter~0 48)} is VALID [2022-04-08 11:12:42,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,629 INFO L272 TraceCheckUtils]: 18: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,630 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #61#return; {8226#(< ~counter~0 48)} is VALID [2022-04-08 11:12:42,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,630 INFO L272 TraceCheckUtils]: 13: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,630 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7715#true} {8226#(< ~counter~0 48)} #59#return; {8226#(< ~counter~0 48)} is VALID [2022-04-08 11:12:42,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {7715#true} assume true; {7715#true} is VALID [2022-04-08 11:12:42,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {7715#true} assume !(0 == ~cond); {7715#true} is VALID [2022-04-08 11:12:42,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#true} ~cond := #in~cond; {7715#true} is VALID [2022-04-08 11:12:42,630 INFO L272 TraceCheckUtils]: 8: Hoare triple {8226#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7715#true} is VALID [2022-04-08 11:12:42,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {8226#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {8226#(< ~counter~0 48)} is VALID [2022-04-08 11:12:42,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {8311#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8226#(< ~counter~0 48)} is VALID [2022-04-08 11:12:42,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {8311#(< ~counter~0 47)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8311#(< ~counter~0 47)} is VALID [2022-04-08 11:12:42,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {8311#(< ~counter~0 47)} call #t~ret6 := main(); {8311#(< ~counter~0 47)} is VALID [2022-04-08 11:12:42,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8311#(< ~counter~0 47)} {7715#true} #81#return; {8311#(< ~counter~0 47)} is VALID [2022-04-08 11:12:42,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {8311#(< ~counter~0 47)} assume true; {8311#(< ~counter~0 47)} is VALID [2022-04-08 11:12:42,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8311#(< ~counter~0 47)} is VALID [2022-04-08 11:12:42,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2022-04-08 11:12:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 11:12:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:42,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567759220] [2022-04-08 11:12:42,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:42,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410845518] [2022-04-08 11:12:42,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410845518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:42,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:42,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:12:42,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:42,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330140346] [2022-04-08 11:12:42,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330140346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:42,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:42,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:12:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036930557] [2022-04-08 11:12:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:42,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-08 11:12:42,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:42,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:42,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:42,691 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:12:42,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:42,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:12:42,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:12:42,692 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:43,083 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-04-08 11:12:43,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:12:43,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-08 11:12:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-08 11:12:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-08 11:12:43,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-08 11:12:43,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:43,179 INFO L225 Difference]: With dead ends: 127 [2022-04-08 11:12:43,179 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 11:12:43,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 11:12:43,180 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:43,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 130 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:12:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 11:12:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-04-08 11:12:43,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:43,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:12:43,301 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:12:43,301 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:12:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:43,303 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-08 11:12:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-08 11:12:43,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:43,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:43,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 112 states. [2022-04-08 11:12:43,304 INFO L87 Difference]: Start difference. First operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 112 states. [2022-04-08 11:12:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:43,305 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-08 11:12:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-08 11:12:43,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:43,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:43,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:43,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:12:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-04-08 11:12:43,307 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 101 [2022-04-08 11:12:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:43,308 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-04-08 11:12:43,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:12:43,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 122 transitions. [2022-04-08 11:12:43,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-04-08 11:12:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-08 11:12:43,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:43,463 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:43,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:43,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 11:12:43,663 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 3 times [2022-04-08 11:12:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783061357] [2022-04-08 11:12:43,900 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:12:43,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:12:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 4 times [2022-04-08 11:12:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:43,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108079933] [2022-04-08 11:12:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:43,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:43,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516172554] [2022-04-08 11:12:43,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:12:43,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:43,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:43,909 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:43,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process