/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/sqrt1-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:38:41,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:38:41,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:38:41,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:38:41,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:38:41,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:38:41,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:38:41,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:38:41,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:38:41,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:38:41,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:38:41,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:38:41,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:38:41,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:38:41,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:38:41,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:38:41,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:38:41,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:38:41,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:38:41,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:38:41,470 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:38:41,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:38:41,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:38:41,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:38:41,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:38:41,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:38:41,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:38:41,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:38:41,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:38:41,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:38:41,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:38:41,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:38:41,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:38:41,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:38:41,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:38:41,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:38:41,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:38:41,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:38:41,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:38:41,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:38:41,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:38:41,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:38:41,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:38:41,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:38:41,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:38:41,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:38:41,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:38:41,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:38:41,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:38:41,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:38:41,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:38:41,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:38:41,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:38:41,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:38:41,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:38:41,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:38:41,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:38:41,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:38:41,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:38:41,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:38:41,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:38:41,501 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:38:41,501 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:38:41,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:38:41,501 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:38:41,501 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:38:41,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:38:41,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:38:41,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:38:41,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:38:41,696 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:38:41,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2022-04-28 14:38:41,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/652cba984/79bf33ec183148aa9a9782abe5865fe4/FLAG94f545700 [2022-04-28 14:38:42,074 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:38:42,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2022-04-28 14:38:42,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/652cba984/79bf33ec183148aa9a9782abe5865fe4/FLAG94f545700 [2022-04-28 14:38:42,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/652cba984/79bf33ec183148aa9a9782abe5865fe4 [2022-04-28 14:38:42,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:38:42,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:38:42,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:38:42,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:38:42,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:38:42,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e56e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42, skipping insertion in model container [2022-04-28 14:38:42,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:38:42,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:38:42,646 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/sqrt1-ll_unwindbound1.c[520,533] [2022-04-28 14:38:42,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:38:42,664 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:38:42,673 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/sqrt1-ll_unwindbound1.c[520,533] [2022-04-28 14:38:42,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:38:42,686 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:38:42,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42 WrapperNode [2022-04-28 14:38:42,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:38:42,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:38:42,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:38:42,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:38:42,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:38:42,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:38:42,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:38:42,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:38:42,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (1/1) ... [2022-04-28 14:38:42,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:38:42,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:38:42,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:38:42,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:38:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:38:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:38:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:38:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:38:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:38:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:38:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:38:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:38:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:38:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:38:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:38:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:38:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:38:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:38:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:38:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:38:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:38:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:38:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:38:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:38:42,808 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:38:42,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:38:42,954 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:38:42,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:38:42,960 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:38:42,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:38:42 BoogieIcfgContainer [2022-04-28 14:38:42,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:38:42,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:38:42,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:38:42,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:38:42,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:38:42" (1/3) ... [2022-04-28 14:38:42,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167f9297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:38:42, skipping insertion in model container [2022-04-28 14:38:42,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:38:42" (2/3) ... [2022-04-28 14:38:42,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167f9297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:38:42, skipping insertion in model container [2022-04-28 14:38:42,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:38:42" (3/3) ... [2022-04-28 14:38:42,968 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound1.c [2022-04-28 14:38:42,997 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:38:42,998 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:38:43,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:38:43,040 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6cedbd93, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a7e301b [2022-04-28 14:38:43,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:38:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:38:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 14:38:43,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:38:43,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:38:43,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:38:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:38:43,078 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-28 14:38:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:43,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94371230] [2022-04-28 14:38:43,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:38:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-28 14:38:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:38:43,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324814294] [2022-04-28 14:38:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:38:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:38:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:38:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:43,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-28 14:38:43,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 14:38:43,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 14:38:43,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:38:43,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-28 14:38:43,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 14:38:43,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 14:38:43,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-28 14:38:43,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-28 14:38:43,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 14:38:43,277 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-28 14:38:43,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 14:38:43,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 14:38:43,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 14:38:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:38:43,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:38:43,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324814294] [2022-04-28 14:38:43,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324814294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:43,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:43,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:38:43,283 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:38:43,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94371230] [2022-04-28 14:38:43,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94371230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:43,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:43,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:38:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22149830] [2022-04-28 14:38:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:38:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 14:38:43,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:38:43,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:43,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:38:43,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:43,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:38:43,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:38:43,332 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:43,493 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-28 14:38:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:38:43,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 14:38:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:38:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 14:38:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 14:38:43,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 14:38:43,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:43,606 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:38:43,606 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 14:38:43,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:38:43,612 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:38:43,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:38:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 14:38:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 14:38:43,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:38:43,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:38:43,646 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:38:43,647 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:38:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:43,651 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 14:38:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 14:38:43,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:43,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:43,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-28 14:38:43,653 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-28 14:38:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:43,660 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 14:38:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 14:38:43,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:43,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:43,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:38:43,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:38:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:38:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-28 14:38:43,666 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-28 14:38:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:38:43,667 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-28 14:38:43,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-28 14:38:43,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 14:38:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:38:43,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:38:43,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:38:43,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:38:43,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:38:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:38:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-28 14:38:43,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:43,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89539175] [2022-04-28 14:38:43,710 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:38:43,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-28 14:38:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:38:43,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188137821] [2022-04-28 14:38:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:38:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:38:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:38:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:43,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:38:43,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:38:43,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:38:43,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:38:43,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:38:43,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:38:43,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:38:43,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-28 14:38:43,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:38:43,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {223#(= |main_#t~post5| 0)} is VALID [2022-04-28 14:38:43,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {218#false} is VALID [2022-04-28 14:38:43,827 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {218#false} is VALID [2022-04-28 14:38:43,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-28 14:38:43,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-28 14:38:43,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-28 14:38:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:38:43,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:38:43,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188137821] [2022-04-28 14:38:43,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188137821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:43,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:43,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:38:43,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:38:43,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89539175] [2022-04-28 14:38:43,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89539175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:43,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:43,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:38:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477117158] [2022-04-28 14:38:43,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:38:43,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:38:43,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:38:43,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:43,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:38:43,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:38:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:38:43,843 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:43,979 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 14:38:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:38:43,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:38:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:38:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 14:38:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 14:38:43,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 14:38:44,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:44,022 INFO L225 Difference]: With dead ends: 32 [2022-04-28 14:38:44,022 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 14:38:44,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:38:44,025 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:38:44,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:38:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 14:38:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 14:38:44,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:38:44,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:38:44,034 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:38:44,035 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:38:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:44,037 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 14:38:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:38:44,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:44,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:44,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-28 14:38:44,039 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-28 14:38:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:44,042 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 14:38:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:38:44,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:44,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:44,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:38:44,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:38:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:38:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 14:38:44,045 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-28 14:38:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:38:44,046 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 14:38:44,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:44,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-28 14:38:44,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:38:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:38:44,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:38:44,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:38:44,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:38:44,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:38:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:38:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-28 14:38:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:44,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [278429023] [2022-04-28 14:38:44,089 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:38:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-28 14:38:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:38:44,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270954546] [2022-04-28 14:38:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:38:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:38:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:44,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:38:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:44,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-28 14:38:44,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 14:38:44,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 14:38:44,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:38:44,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-28 14:38:44,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 14:38:44,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 14:38:44,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 14:38:44,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:38:44,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:38:44,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 1);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:38:44,158 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:38:44,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:38:44,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-28 14:38:44,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 14:38:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:38:44,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:38:44,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270954546] [2022-04-28 14:38:44,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270954546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:44,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:44,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:38:44,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:38:44,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [278429023] [2022-04-28 14:38:44,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [278429023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:44,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:44,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:38:44,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747277633] [2022-04-28 14:38:44,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:38:44,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:38:44,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:38:44,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:44,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:44,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:38:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:38:44,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:38:44,174 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:44,481 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 14:38:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:38:44,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:38:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:38:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 14:38:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 14:38:44,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 14:38:44,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:44,545 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:38:44,545 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:38:44,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:38:44,546 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:38:44,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:38:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:38:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 14:38:44,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:38:44,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:38:44,552 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:38:44,552 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:38:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:44,554 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 14:38:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 14:38:44,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:44,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:44,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 14:38:44,555 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 14:38:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:44,557 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 14:38:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 14:38:44,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:44,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:44,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:38:44,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:38:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:38:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 14:38:44,559 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 14:38:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:38:44,560 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 14:38:44,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:38:44,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 14:38:44,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 14:38:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:38:44,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:38:44,594 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:38:44,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 14:38:44,594 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:38:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:38:44,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-28 14:38:44,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:44,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254446314] [2022-04-28 14:38:44,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:38:44,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-28 14:38:44,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:38:44,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204401158] [2022-04-28 14:38:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:38:44,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:38:44,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:38:44,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312332374] [2022-04-28 14:38:44,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:38:44,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:38:44,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:38:44,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:38:44,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:38:44,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:38:44,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:38:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:44,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:38:44,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-28 14:38:44,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {608#true} is VALID [2022-04-28 14:38:44,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 14:38:44,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-28 14:38:44,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-28 14:38:44,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:38:44,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:38:44,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:38:44,793 INFO L272 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {608#true} is VALID [2022-04-28 14:38:44,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-28 14:38:44,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-28 14:38:44,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 14:38:44,794 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {608#true} {628#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:38:44,794 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:38:44,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:44,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-28 14:38:44,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-28 14:38:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:38:44,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:38:44,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:38:44,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204401158] [2022-04-28 14:38:44,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:38:44,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312332374] [2022-04-28 14:38:44,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312332374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:44,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:44,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:38:44,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:38:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254446314] [2022-04-28 14:38:44,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254446314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:44,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:44,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:38:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133931918] [2022-04-28 14:38:44,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:38:44,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 14:38:44,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:38:44,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:38:44,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:44,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:38:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:44,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:38:44,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:38:44,824 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:38:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:44,949 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 14:38:44,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:38:44,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 14:38:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:38:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:38:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:38:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:38:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:38:44,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 14:38:44,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:44,985 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:38:44,985 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:38:44,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:38:44,986 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:38:44,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:38:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:38:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 14:38:44,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:38:44,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:38:44,996 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:38:44,996 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:38:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:44,998 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:38:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:38:44,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:44,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:44,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:38:44,998 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:38:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:45,000 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:38:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:38:45,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:45,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:45,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:38:45,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:38:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:38:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 14:38:45,002 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-28 14:38:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:38:45,002 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 14:38:45,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:38:45,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 14:38:45,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 14:38:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:38:45,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:38:45,043 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:38:45,065 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-28 14:38:45,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:45,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:38:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:38:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-28 14:38:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:45,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573975090] [2022-04-28 14:38:45,260 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:38:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-28 14:38:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:38:45,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994418624] [2022-04-28 14:38:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:38:45,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:38:45,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:38:45,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100815561] [2022-04-28 14:38:45,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:38:45,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:45,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:38:45,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:38:45,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:38:45,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:38:45,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:38:45,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:38:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:45,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:38:45,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-28 14:38:45,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {895#true} is VALID [2022-04-28 14:38:45,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:38:45,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-28 14:38:45,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-28 14:38:45,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:45,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:45,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:45,433 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {895#true} is VALID [2022-04-28 14:38:45,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 14:38:45,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 14:38:45,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:38:45,434 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:45,436 INFO L272 TraceCheckUtils]: 13: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {895#true} is VALID [2022-04-28 14:38:45,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 14:38:45,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 14:38:45,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:38:45,438 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:45,438 INFO L272 TraceCheckUtils]: 18: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:38:45,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:45,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-28 14:38:45,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-28 14:38:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:38:45,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:38:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:38:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994418624] [2022-04-28 14:38:45,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:38:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100815561] [2022-04-28 14:38:45,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100815561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:45,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:45,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:38:45,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:38:45,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573975090] [2022-04-28 14:38:45,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573975090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:45,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:45,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:38:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599052429] [2022-04-28 14:38:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:38:45,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:38:45,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:38:45,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:38:45,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:45,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:38:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:38:45,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:38:45,455 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:38:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:45,576 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 14:38:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:38:45,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:38:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:38:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:38:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:38:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:38:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:38:45,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 14:38:45,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:45,610 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:38:45,610 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 14:38:45,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:38:45,612 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:38:45,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:38:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 14:38:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 14:38:45,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:38:45,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:38:45,628 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:38:45,628 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:38:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:45,630 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 14:38:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:38:45,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:45,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:45,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-28 14:38:45,632 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-28 14:38:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:45,634 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 14:38:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:38:45,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:45,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:45,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:38:45,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:38:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:38:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 14:38:45,636 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-28 14:38:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:38:45,637 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 14:38:45,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:38:45,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-28 14:38:45,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:38:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:38:45,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:38:45,674 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:38:45,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:38:45,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:45,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:38:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:38:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-28 14:38:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:45,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048166447] [2022-04-28 14:38:46,140 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:38:46,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:38:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 2 times [2022-04-28 14:38:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:38:46,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155295239] [2022-04-28 14:38:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:38:46,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:38:46,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:38:46,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619757513] [2022-04-28 14:38:46,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:38:46,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:38:46,150 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:38:46,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:38:46,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:38:46,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:38:46,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:38:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:46,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:38:46,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 14:38:46,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#true} is VALID [2022-04-28 14:38:46,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:38:46,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #66#return; {1211#true} is VALID [2022-04-28 14:38:46,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret6 := main(); {1211#true} is VALID [2022-04-28 14:38:46,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:38:46,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:38:46,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:38:46,314 INFO L272 TraceCheckUtils]: 8: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 14:38:46,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:38:46,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:38:46,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:38:46,315 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1231#(and (= main_~a~0 0) (= main_~t~0 1))} #54#return; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:38:46,315 INFO L272 TraceCheckUtils]: 13: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1211#true} is VALID [2022-04-28 14:38:46,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:38:46,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:38:46,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:38:46,316 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1211#true} {1231#(and (= main_~a~0 0) (= main_~t~0 1))} #56#return; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:38:46,316 INFO L272 TraceCheckUtils]: 18: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1211#true} is VALID [2022-04-28 14:38:46,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:38:46,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:38:46,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:38:46,317 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1211#true} {1231#(and (= main_~a~0 0) (= main_~t~0 1))} #58#return; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:38:46,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:38:46,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:38:46,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !(#t~post5 < 1);havoc #t~post5; {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:38:46,319 INFO L272 TraceCheckUtils]: 26: Hoare triple {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:38:46,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:46,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {1300#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 14:38:46,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 14:38:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:38:46,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:38:46,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 14:38:46,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {1300#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 14:38:46,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:46,450 INFO L272 TraceCheckUtils]: 26: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:38:46,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !(#t~post5 < 1);havoc #t~post5; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,452 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1211#true} {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #58#return; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:38:46,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:38:46,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:38:46,452 INFO L272 TraceCheckUtils]: 18: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1211#true} is VALID [2022-04-28 14:38:46,453 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1211#true} {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #56#return; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:38:46,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:38:46,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:38:46,453 INFO L272 TraceCheckUtils]: 13: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1211#true} is VALID [2022-04-28 14:38:46,454 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #54#return; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:38:46,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:38:46,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:38:46,454 INFO L272 TraceCheckUtils]: 8: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 14:38:46,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 1);havoc #t~post5; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:38:46,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret6 := main(); {1211#true} is VALID [2022-04-28 14:38:46,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #66#return; {1211#true} is VALID [2022-04-28 14:38:46,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:38:46,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#true} is VALID [2022-04-28 14:38:46,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 14:38:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 14:38:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:38:46,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155295239] [2022-04-28 14:38:46,456 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:38:46,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619757513] [2022-04-28 14:38:46,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619757513] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:38:46,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:38:46,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:38:46,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:38:46,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048166447] [2022-04-28 14:38:46,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048166447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:46,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:46,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:38:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047835805] [2022-04-28 14:38:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:38:46,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 30 [2022-04-28 14:38:46,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:38:46,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:38:46,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:46,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:38:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:38:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:38:46,473 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:38:54,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:38:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:54,508 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 14:38:54,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:38:54,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 30 [2022-04-28 14:38:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:38:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:38:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:38:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:38:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:38:54,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 14:38:54,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:54,551 INFO L225 Difference]: With dead ends: 45 [2022-04-28 14:38:54,551 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 14:38:54,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:38:54,552 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-28 14:38:54,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2022-04-28 14:38:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 14:38:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 14:38:54,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:38:54,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:38:54,572 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:38:54,573 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:38:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:54,575 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:38:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:38:54,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:54,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:54,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 14:38:54,576 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 14:38:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:54,577 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:38:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:38:54,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:54,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:54,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:38:54,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:38:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:38:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-28 14:38:54,578 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 30 [2022-04-28 14:38:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:38:54,579 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-28 14:38:54,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:38:54,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-28 14:38:54,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:38:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:38:54,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:38:54,623 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:38:54,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:38:54,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:54,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:38:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:38:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -775311695, now seen corresponding path program 1 times [2022-04-28 14:38:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:54,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1711489062] [2022-04-28 14:38:55,014 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:38:55,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:38:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -775311695, now seen corresponding path program 2 times [2022-04-28 14:38:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:38:55,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551166694] [2022-04-28 14:38:55,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:38:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:38:55,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:38:55,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250425545] [2022-04-28 14:38:55,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:38:55,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:55,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:38:55,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:38:55,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:38:55,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:38:55,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:38:55,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:38:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:55,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:38:55,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2022-04-28 14:38:55,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1661#true} is VALID [2022-04-28 14:38:55,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #66#return; {1661#true} is VALID [2022-04-28 14:38:55,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret6 := main(); {1661#true} is VALID [2022-04-28 14:38:55,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {1661#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:55,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:55,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:55,257 INFO L272 TraceCheckUtils]: 8: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1661#true} is VALID [2022-04-28 14:38:55,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:38:55,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:38:55,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,259 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #54#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:55,259 INFO L272 TraceCheckUtils]: 13: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1661#true} is VALID [2022-04-28 14:38:55,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:38:55,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:38:55,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,260 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #56#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:55,260 INFO L272 TraceCheckUtils]: 18: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1661#true} is VALID [2022-04-28 14:38:55,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:38:55,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:38:55,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,260 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #58#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:38:55,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} is VALID [2022-04-28 14:38:55,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} is VALID [2022-04-28 14:38:55,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} assume !(#t~post5 < 1);havoc #t~post5; {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} is VALID [2022-04-28 14:38:55,262 INFO L272 TraceCheckUtils]: 26: Hoare triple {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1661#true} is VALID [2022-04-28 14:38:55,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:38:55,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:38:55,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,263 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1661#true} {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} #60#return; {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} is VALID [2022-04-28 14:38:55,263 INFO L272 TraceCheckUtils]: 31: Hoare triple {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:38:55,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:55,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {1765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1662#false} is VALID [2022-04-28 14:38:55,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2022-04-28 14:38:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:38:55,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:38:55,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2022-04-28 14:38:55,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {1765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1662#false} is VALID [2022-04-28 14:38:55,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:55,394 INFO L272 TraceCheckUtils]: 31: Hoare triple {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:38:55,395 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1661#true} {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #60#return; {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:38:55,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:38:55,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:38:55,395 INFO L272 TraceCheckUtils]: 26: Hoare triple {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1661#true} is VALID [2022-04-28 14:38:55,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !(#t~post5 < 1);havoc #t~post5; {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:38:55,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:38:55,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:38:55,439 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1661#true} {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #58#return; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:38:55,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:38:55,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:38:55,439 INFO L272 TraceCheckUtils]: 18: Hoare triple {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1661#true} is VALID [2022-04-28 14:38:55,440 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1661#true} {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #56#return; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:38:55,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:38:55,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:38:55,440 INFO L272 TraceCheckUtils]: 13: Hoare triple {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1661#true} is VALID [2022-04-28 14:38:55,444 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1661#true} {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #54#return; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:38:55,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:38:55,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:38:55,444 INFO L272 TraceCheckUtils]: 8: Hoare triple {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1661#true} is VALID [2022-04-28 14:38:55,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(#t~post5 < 1);havoc #t~post5; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:38:55,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:38:55,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {1661#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:38:55,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret6 := main(); {1661#true} is VALID [2022-04-28 14:38:55,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #66#return; {1661#true} is VALID [2022-04-28 14:38:55,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:38:55,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1661#true} is VALID [2022-04-28 14:38:55,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2022-04-28 14:38:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:38:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:38:55,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551166694] [2022-04-28 14:38:55,447 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:38:55,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250425545] [2022-04-28 14:38:55,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250425545] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:38:55,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:38:55,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 14:38:55,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:38:55,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1711489062] [2022-04-28 14:38:55,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1711489062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:55,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:55,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:38:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708363945] [2022-04-28 14:38:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:38:55,448 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-28 14:38:55,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:38:55,448 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:38:55,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:55,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:38:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:38:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:38:55,471 INFO L87 Difference]: Start difference. First operand 43 states and 48 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:38:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:55,699 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-28 14:38:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:38:55,699 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-28 14:38:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:38:55,700 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:38:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-28 14:38:55,701 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:38:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-28 14:38:55,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-28 14:38:55,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:55,749 INFO L225 Difference]: With dead ends: 58 [2022-04-28 14:38:55,749 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 14:38:55,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:38:55,749 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:38:55,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 107 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:38:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 14:38:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-28 14:38:55,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:38:55,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:38:55,784 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:38:55,784 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:38:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:55,788 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 14:38:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 14:38:55,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:55,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:55,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 56 states. [2022-04-28 14:38:55,789 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 56 states. [2022-04-28 14:38:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:38:55,795 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 14:38:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 14:38:55,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:38:55,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:38:55,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:38:55,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:38:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:38:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-28 14:38:55,800 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 35 [2022-04-28 14:38:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:38:55,801 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-28 14:38:55,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:38:55,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-28 14:38:55,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-28 14:38:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 14:38:55,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:38:55,864 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:38:55,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:38:56,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:56,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:38:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:38:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 296432442, now seen corresponding path program 1 times [2022-04-28 14:38:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:56,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032590221] [2022-04-28 14:38:56,269 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:38:56,270 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:38:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 296432442, now seen corresponding path program 2 times [2022-04-28 14:38:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:38:56,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190579301] [2022-04-28 14:38:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:38:56,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:38:56,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:38:56,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729986052] [2022-04-28 14:38:56,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:38:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:38:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:38:56,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:38:56,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:38:56,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:38:56,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:38:56,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 14:38:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:38:56,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:38:56,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {2218#true} call ULTIMATE.init(); {2218#true} is VALID [2022-04-28 14:38:56,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2218#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2218#true} is VALID [2022-04-28 14:38:56,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:56,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2218#true} {2218#true} #66#return; {2218#true} is VALID [2022-04-28 14:38:56,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {2218#true} call #t~ret6 := main(); {2218#true} is VALID [2022-04-28 14:38:56,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {2218#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 14:38:56,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 14:38:56,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} assume !!(#t~post5 < 1);havoc #t~post5; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 14:38:56,564 INFO L272 TraceCheckUtils]: 8: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:56,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-28 14:38:56,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-28 14:38:56,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:56,565 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2218#true} {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} #54#return; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 14:38:56,565 INFO L272 TraceCheckUtils]: 13: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:56,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-28 14:38:56,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-28 14:38:56,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:56,565 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2218#true} {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} #56#return; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 14:38:56,565 INFO L272 TraceCheckUtils]: 18: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:56,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-28 14:38:56,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-28 14:38:56,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:56,566 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2218#true} {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} #58#return; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 14:38:56,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} is VALID [2022-04-28 14:38:56,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} is VALID [2022-04-28 14:38:56,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} assume !(#t~post5 < 1);havoc #t~post5; {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} is VALID [2022-04-28 14:38:56,567 INFO L272 TraceCheckUtils]: 26: Hoare triple {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:56,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {2218#true} ~cond := #in~cond; {2306#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:56,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {2306#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:38:56,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:38:56,569 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} #60#return; {2317#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:38:56,569 INFO L272 TraceCheckUtils]: 31: Hoare triple {2317#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:56,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-28 14:38:56,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-28 14:38:56,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:56,570 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2218#true} {2317#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #62#return; {2317#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:38:56,573 INFO L272 TraceCheckUtils]: 36: Hoare triple {2317#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2336#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:38:56,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {2336#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:56,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {2340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2219#false} is VALID [2022-04-28 14:38:56,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {2219#false} assume !false; {2219#false} is VALID [2022-04-28 14:38:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 14:38:56,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:38:57,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {2219#false} assume !false; {2219#false} is VALID [2022-04-28 14:38:57,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {2340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2219#false} is VALID [2022-04-28 14:38:57,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {2336#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:38:57,611 INFO L272 TraceCheckUtils]: 36: Hoare triple {2356#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2336#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:38:57,612 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2218#true} {2356#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #62#return; {2356#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:38:57,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:57,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-28 14:38:57,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-28 14:38:57,612 INFO L272 TraceCheckUtils]: 31: Hoare triple {2356#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:57,613 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} #60#return; {2356#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:38:57,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:38:57,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {2385#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:38:57,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {2218#true} ~cond := #in~cond; {2385#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:38:57,614 INFO L272 TraceCheckUtils]: 26: Hoare triple {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:57,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} assume !(#t~post5 < 1);havoc #t~post5; {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} is VALID [2022-04-28 14:38:57,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} is VALID [2022-04-28 14:38:59,616 WARN L290 TraceCheckUtils]: 23: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} is UNKNOWN [2022-04-28 14:38:59,617 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2218#true} {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} #58#return; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-28 14:38:59,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:59,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-28 14:38:59,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-28 14:38:59,617 INFO L272 TraceCheckUtils]: 18: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:59,618 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2218#true} {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} #56#return; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-28 14:38:59,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:59,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-28 14:38:59,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-28 14:38:59,618 INFO L272 TraceCheckUtils]: 13: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:59,618 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2218#true} {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} #54#return; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-28 14:38:59,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:59,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-28 14:38:59,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-28 14:38:59,619 INFO L272 TraceCheckUtils]: 8: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2218#true} is VALID [2022-04-28 14:38:59,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} assume !!(#t~post5 < 1);havoc #t~post5; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-28 14:38:59,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-28 14:38:59,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {2218#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-28 14:38:59,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {2218#true} call #t~ret6 := main(); {2218#true} is VALID [2022-04-28 14:38:59,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2218#true} {2218#true} #66#return; {2218#true} is VALID [2022-04-28 14:38:59,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-28 14:38:59,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2218#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2218#true} is VALID [2022-04-28 14:38:59,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {2218#true} call ULTIMATE.init(); {2218#true} is VALID [2022-04-28 14:38:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 14:38:59,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:38:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190579301] [2022-04-28 14:38:59,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:38:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729986052] [2022-04-28 14:38:59,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729986052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:38:59,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:38:59,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 14:38:59,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:38:59,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032590221] [2022-04-28 14:38:59,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032590221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:38:59,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:38:59,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:38:59,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471170856] [2022-04-28 14:38:59,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:38:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 14:38:59,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:38:59,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:38:59,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:38:59,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:38:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:38:59,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:38:59,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:38:59,646 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:39:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:00,232 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-28 14:39:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:39:00,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 14:39:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:39:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-04-28 14:39:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:39:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-04-28 14:39:00,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2022-04-28 14:39:00,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:00,306 INFO L225 Difference]: With dead ends: 62 [2022-04-28 14:39:00,306 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 14:39:00,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:39:00,306 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:00,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 109 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:39:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 14:39:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 14:39:00,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:00,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:39:00,341 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:39:00,341 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:39:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:00,342 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-28 14:39:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-28 14:39:00,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:00,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:00,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-04-28 14:39:00,343 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-04-28 14:39:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:00,345 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-28 14:39:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-28 14:39:00,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:00,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:00,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:00,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:39:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-04-28 14:39:00,347 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 40 [2022-04-28 14:39:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:00,347 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-04-28 14:39:00,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 14:39:00,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 63 transitions. [2022-04-28 14:39:00,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-28 14:39:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 14:39:00,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:00,403 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:00,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:00,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:00,611 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1748438349, now seen corresponding path program 3 times [2022-04-28 14:39:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:00,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [101848337] [2022-04-28 14:39:00,755 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:39:00,755 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:39:00,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1748438349, now seen corresponding path program 4 times [2022-04-28 14:39:00,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:00,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456856069] [2022-04-28 14:39:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:00,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:00,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:00,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708570406] [2022-04-28 14:39:00,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:39:00,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:00,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:00,780 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:00,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:39:00,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:39:00,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:00,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 14:39:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:00,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:01,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #66#return; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret6 := main(); {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {2826#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {2826#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {2826#true} assume !!(#t~post5 < 1);havoc #t~post5; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L272 TraceCheckUtils]: 8: Hoare triple {2826#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2022-04-28 14:39:01,051 INFO L272 TraceCheckUtils]: 13: Hoare triple {2826#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2826#true} {2826#true} #56#return; {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L272 TraceCheckUtils]: 18: Hoare triple {2826#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,052 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2826#true} {2826#true} #58#return; {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {2826#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {2826#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#true} assume !!(#t~post5 < 1);havoc #t~post5; {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L272 TraceCheckUtils]: 26: Hoare triple {2826#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2022-04-28 14:39:01,053 INFO L272 TraceCheckUtils]: 31: Hoare triple {2826#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {2826#true} ~cond := #in~cond; {2927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:01,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {2927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:01,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:01,055 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} {2826#true} #56#return; {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:01,056 INFO L272 TraceCheckUtils]: 36: Hoare triple {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,056 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2826#true} {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:01,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-28 14:39:01,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-28 14:39:01,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} assume !(#t~post5 < 1);havoc #t~post5; {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-28 14:39:01,060 INFO L272 TraceCheckUtils]: 44: Hoare triple {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {2826#true} ~cond := #in~cond; {2927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:01,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {2927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:01,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:01,061 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #60#return; {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:01,062 INFO L272 TraceCheckUtils]: 49: Hoare triple {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:01,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:01,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {2986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2827#false} is VALID [2022-04-28 14:39:01,063 INFO L290 TraceCheckUtils]: 52: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2022-04-28 14:39:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 14:39:01,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:39:01,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2022-04-28 14:39:01,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {2986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2827#false} is VALID [2022-04-28 14:39:01,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:01,403 INFO L272 TraceCheckUtils]: 49: Hoare triple {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:01,404 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #60#return; {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:01,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:01,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {3015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:01,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {2826#true} ~cond := #in~cond; {3015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:39:01,405 INFO L272 TraceCheckUtils]: 44: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} assume !(#t~post5 < 1);havoc #t~post5; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-28 14:39:01,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-28 14:39:01,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-28 14:39:01,408 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2826#true} {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #58#return; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-28 14:39:01,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,409 INFO L272 TraceCheckUtils]: 36: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,414 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} {2826#true} #56#return; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-28 14:39:01,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:01,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {3015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {2826#true} ~cond := #in~cond; {3015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:39:01,415 INFO L272 TraceCheckUtils]: 31: Hoare triple {2826#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L272 TraceCheckUtils]: 26: Hoare triple {2826#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#true} assume !!(#t~post5 < 1);havoc #t~post5; {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {2826#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {2826#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2826#true} {2826#true} #58#return; {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L272 TraceCheckUtils]: 18: Hoare triple {2826#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2826#true} {2826#true} #56#return; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L272 TraceCheckUtils]: 13: Hoare triple {2826#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L272 TraceCheckUtils]: 8: Hoare triple {2826#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {2826#true} assume !!(#t~post5 < 1);havoc #t~post5; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {2826#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {2826#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret6 := main(); {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #66#return; {2826#true} is VALID [2022-04-28 14:39:01,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-28 14:39:01,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2826#true} is VALID [2022-04-28 14:39:01,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2826#true} is VALID [2022-04-28 14:39:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 14:39:01,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:01,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456856069] [2022-04-28 14:39:01,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:01,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708570406] [2022-04-28 14:39:01,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708570406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:39:01,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:39:01,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 14:39:01,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:01,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [101848337] [2022-04-28 14:39:01,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [101848337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:01,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:01,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:39:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958091314] [2022-04-28 14:39:01,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:01,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2022-04-28 14:39:01,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:01,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 14:39:01,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:01,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:39:01,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:01,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:39:01,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:39:01,464 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 14:39:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:01,859 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-28 14:39:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:01,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2022-04-28 14:39:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 14:39:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 14:39:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 14:39:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 14:39:01,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-28 14:39:01,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:01,887 INFO L225 Difference]: With dead ends: 57 [2022-04-28 14:39:01,887 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:39:01,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:39:01,888 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:01,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:39:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:39:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:39:01,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:01,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:01,889 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:01,889 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:01,889 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:39:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:01,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:01,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:01,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:39:01,889 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:39:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:01,889 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:39:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:01,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:01,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:01,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:01,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:39:01,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-04-28 14:39:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:01,890 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:39:01,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 14:39:01,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:39:01,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:01,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:01,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:39:01,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:02,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:02,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:39:02,573 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:39:02,573 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:39:02,573 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:39:02,573 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:02,573 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-28 14:39:02,573 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:02,573 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:02,573 INFO L895 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 21 49) the Hoare annotation is: true [2022-04-28 14:39:02,574 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-28 14:39:02,574 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 21 49) the Hoare annotation is: true [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L30-1(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:02,574 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:02,574 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:39:02,574 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:39:02,574 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:39:02,574 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:39:02,575 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:02,575 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:02,575 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:02,575 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:39:02,577 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 14:39:02,580 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:39:02,587 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:39:02,588 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 14:39:02,589 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:39:02,589 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 14:39:02,590 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 14:39:02,592 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 14:39:02,599 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:39:02,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:39:02 BoogieIcfgContainer [2022-04-28 14:39:02,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:39:02,612 INFO L158 Benchmark]: Toolchain (without parser) took 20096.77ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 170.1MB in the beginning and 193.6MB in the end (delta: -23.6MB). Peak memory consumption was 124.5MB. Max. memory is 8.0GB. [2022-04-28 14:39:02,612 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory was 186.1MB in the beginning and 186.0MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:39:02,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.59ms. Allocated memory is still 218.1MB. Free memory was 169.9MB in the beginning and 195.5MB in the end (delta: -25.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-28 14:39:02,612 INFO L158 Benchmark]: Boogie Preprocessor took 21.01ms. Allocated memory is still 218.1MB. Free memory was 195.5MB in the beginning and 193.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 14:39:02,612 INFO L158 Benchmark]: RCFGBuilder took 252.17ms. Allocated memory is still 218.1MB. Free memory was 193.9MB in the beginning and 181.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:39:02,613 INFO L158 Benchmark]: TraceAbstraction took 19648.38ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 181.4MB in the beginning and 193.6MB in the end (delta: -12.3MB). Peak memory consumption was 135.6MB. Max. memory is 8.0GB. [2022-04-28 14:39:02,617 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory was 186.1MB in the beginning and 186.0MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.59ms. Allocated memory is still 218.1MB. Free memory was 169.9MB in the beginning and 195.5MB in the end (delta: -25.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.01ms. Allocated memory is still 218.1MB. Free memory was 195.5MB in the beginning and 193.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 252.17ms. Allocated memory is still 218.1MB. Free memory was 193.9MB in the beginning and 181.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 19648.38ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 181.4MB in the beginning and 193.6MB in the end (delta: -12.3MB). Peak memory consumption was 135.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 662 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 426 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 598 IncrementalHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 236 mSDtfsCounter, 598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 316 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 182 PreInvPairs, 266 NumberOfFragments, 278 HoareAnnotationTreeSize, 182 FomulaSimplifications, 322 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 26 FomulaSimplificationsInter, 886 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (s == t + a * a && t == a * 2 + 1) || !(\old(counter) == 0) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:39:02,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...