/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:36:22,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:36:22,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:36:22,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:36:22,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:36:22,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:36:22,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:36:22,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:36:22,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:36:22,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:36:22,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:36:22,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:36:22,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:36:22,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:36:22,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:36:22,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:36:22,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:36:22,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:36:22,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:36:22,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:36:22,639 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:36:22,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:36:22,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:36:22,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:36:22,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:36:22,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:36:22,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:36:22,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:36:22,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:36:22,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:36:22,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:36:22,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:36:22,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:36:22,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:36:22,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:36:22,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:36:22,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:36:22,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:36:22,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:36:22,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:36:22,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:36:22,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:36:22,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:36:22,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:36:22,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:36:22,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:36:22,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:36:22,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:36:22,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:36:22,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:36:22,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:36:22,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:36:22,670 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:36:22,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:36:22,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:36:22,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:36:22,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:36:22,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:36:22,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:36:22,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:36:22,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:36:22,671 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:36:22,671 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:36:22,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:36:22,671 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:36:22,671 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:36:22,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:36:22,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:36:22,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:36:22,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:36:22,898 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:36:22,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2022-04-08 14:36:22,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/716f8c55b/1a27db3495004970b6e406a622ce7c8e/FLAG593d29a36 [2022-04-08 14:36:23,289 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:36:23,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2022-04-08 14:36:23,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/716f8c55b/1a27db3495004970b6e406a622ce7c8e/FLAG593d29a36 [2022-04-08 14:36:23,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/716f8c55b/1a27db3495004970b6e406a622ce7c8e [2022-04-08 14:36:23,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:36:23,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:36:23,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:36:23,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:36:23,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:36:23,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d5a259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23, skipping insertion in model container [2022-04-08 14:36:23,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:36:23,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:36:23,516 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_unwindbound10.c[520,533] [2022-04-08 14:36:23,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:36:23,546 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:36:23,560 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_unwindbound10.c[520,533] [2022-04-08 14:36:23,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:36:23,586 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:36:23,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23 WrapperNode [2022-04-08 14:36:23,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:36:23,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:36:23,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:36:23,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:36:23,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:36:23,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:36:23,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:36:23,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:36:23,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (1/1) ... [2022-04-08 14:36:23,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:36:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:23,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:36:23,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:36:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:36:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:36:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:36:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:36:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:36:23,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:36:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:36:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:36:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:36:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:36:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:36:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:36:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:36:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:36:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:36:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:36:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:36:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:36:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:36:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:36:23,741 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:36:23,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:36:23,903 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:36:23,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:36:23,907 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:36:23,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:36:23 BoogieIcfgContainer [2022-04-08 14:36:23,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:36:23,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:36:23,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:36:23,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:36:23,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:36:23" (1/3) ... [2022-04-08 14:36:23,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518989bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:36:23, skipping insertion in model container [2022-04-08 14:36:23,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:23" (2/3) ... [2022-04-08 14:36:23,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518989bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:36:23, skipping insertion in model container [2022-04-08 14:36:23,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:36:23" (3/3) ... [2022-04-08 14:36:23,925 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound10.c [2022-04-08 14:36:23,945 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:36:23,945 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:36:23,983 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:36:23,987 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:36:23,988 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:36:24,001 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-08 14:36:24,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 14:36:24,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:24,007 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:24,008 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:24,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-08 14:36:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:24,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1786605087] [2022-04-08 14:36:24,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-08 14:36:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:24,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497408156] [2022-04-08 14:36:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:36:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:24,174 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-08 14:36:24,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 14:36:24,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-08 14:36:24,176 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-08 14:36:24,176 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-08 14:36:24,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 14:36:24,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-08 14:36:24,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-08 14:36:24,177 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-08 14:36:24,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-08 14:36:24,178 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-08 14:36:24,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-08 14:36:24,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-08 14:36:24,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 14:36:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:36:24,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:24,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497408156] [2022-04-08 14:36:24,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497408156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:24,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:24,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:36:24,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:24,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1786605087] [2022-04-08 14:36:24,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1786605087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:24,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:24,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:36:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944081240] [2022-04-08 14:36:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:24,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 14:36:24,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:24,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:24,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:24,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:36:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:36:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:36:24,218 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-08 14:36:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:24,361 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-08 14:36:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:36:24,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 14:36:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 14:36:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 14:36:24,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 14:36:24,469 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-08 14:36:24,475 INFO L225 Difference]: With dead ends: 47 [2022-04-08 14:36:24,475 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 14:36:24,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:36:24,479 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:24,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:36:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 14:36:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 14:36:24,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:24,504 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-08 14:36:24,504 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-08 14:36:24,505 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-08 14:36:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:24,510 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 14:36:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 14:36:24,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:24,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:24,511 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-08 14:36:24,511 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-08 14:36:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:24,514 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 14:36:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 14:36:24,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:24,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:24,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:24,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:24,515 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-08 14:36:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-08 14:36:24,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-08 14:36:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:24,518 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-08 14:36:24,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:24,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-08 14:36:24,545 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-08 14:36:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-08 14:36:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:36:24,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:24,550 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:24,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:36:24,551 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-08 14:36:24,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:24,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2080444411] [2022-04-08 14:36:24,553 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-08 14:36:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:24,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177909636] [2022-04-08 14:36:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:24,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:36:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:24,617 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-08 14:36:24,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:24,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:24,619 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-08 14:36:24,619 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-08 14:36:24,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:24,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:24,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:24,621 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-08 14:36:24,622 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-08 14:36:24,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {218#false} is VALID [2022-04-08 14:36:24,622 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-08 14:36:24,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-08 14:36:24,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-08 14:36:24,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-08 14:36:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:36:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:24,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177909636] [2022-04-08 14:36:24,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177909636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:24,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:24,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:36:24,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:24,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2080444411] [2022-04-08 14:36:24,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2080444411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:24,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:24,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:36:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430178851] [2022-04-08 14:36:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:36:24,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:24,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:24,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:24,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:24,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:24,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:24,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:36:24,636 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-08 14:36:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:24,798 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 14:36:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:36:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:36:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:36:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:36:24,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 14:36:24,846 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-08 14:36:24,848 INFO L225 Difference]: With dead ends: 32 [2022-04-08 14:36:24,849 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 14:36:24,849 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:36:24,852 INFO L913 BasicCegarLoop]: 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-08 14:36:24,852 INFO L914 BasicCegarLoop]: 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-08 14:36:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 14:36:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 14:36:24,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:24,869 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-08 14:36:24,870 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-08 14:36:24,870 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-08 14:36:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:24,872 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 14:36:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:36:24,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:24,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:24,873 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-08 14:36:24,873 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-08 14:36:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:24,874 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 14:36:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:36:24,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:24,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:24,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:24,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:24,877 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-08 14:36:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-08 14:36:24,879 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-08 14:36:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:24,879 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-08 14:36:24,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:24,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-08 14:36:24,911 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-08 14:36:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:36:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:36:24,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:24,915 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:24,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:36:24,916 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:24,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-08 14:36:24,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:24,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790185487] [2022-04-08 14:36:24,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-08 14:36:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:24,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360742713] [2022-04-08 14:36:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:36:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:25,037 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-08 14:36:25,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 14:36:25,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-08 14:36:25,038 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-08 14:36:25,039 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-08 14:36:25,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 14:36:25,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-08 14:36:25,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-08 14:36:25,040 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-08 14:36:25,041 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-08 14:36:25,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:36:25,046 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-08 14:36:25,046 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-08 14:36:25,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-08 14:36:25,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-08 14:36:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:36:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360742713] [2022-04-08 14:36:25,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360742713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:25,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:25,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:36:25,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:25,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790185487] [2022-04-08 14:36:25,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790185487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:25,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:25,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:36:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100893921] [2022-04-08 14:36:25,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:25,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:36:25,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:25,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:25,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:25,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:36:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:25,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:36:25,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:36:25,067 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-08 14:36:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:25,359 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 14:36:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:36:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:36:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 14:36:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 14:36:25,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 14:36:25,417 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-08 14:36:25,419 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:36:25,419 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 14:36:25,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:36:25,422 INFO L913 BasicCegarLoop]: 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-08 14:36:25,424 INFO L914 BasicCegarLoop]: 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-08 14:36:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 14:36:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 14:36:25,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:25,432 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-08 14:36:25,432 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-08 14:36:25,432 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-08 14:36:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:25,434 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 14:36:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 14:36:25,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:25,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:25,435 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-08 14:36:25,436 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-08 14:36:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:25,437 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 14:36:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 14:36:25,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:25,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:25,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:25,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:25,438 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-08 14:36:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 14:36:25,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 14:36:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:25,440 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 14:36:25,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:25,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 14:36:25,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 14:36:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:36:25,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:25,474 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:25,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:36:25,474 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-08 14:36:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:25,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1947952675] [2022-04-08 14:36:25,475 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-08 14:36:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214488831] [2022-04-08 14:36:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:25,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:25,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455465908] [2022-04-08 14:36:25,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:25,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:25,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:25,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:36:25,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:25,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:25,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:36:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:25,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:25,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-08 14:36:25,702 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-08 14:36:25,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 14:36:25,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-08 14:36:25,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-08 14:36:25,703 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-08 14:36:25,704 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-08 14:36:25,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:36:25,704 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-08 14:36:25,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-08 14:36:25,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-08 14:36:25,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 14:36:25,705 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-08 14:36:25,706 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-08 14:36:25,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:25,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-08 14:36:25,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-08 14:36:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:36:25,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:36:25,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:25,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214488831] [2022-04-08 14:36:25,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:25,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455465908] [2022-04-08 14:36:25,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455465908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:25,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:25,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:25,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:25,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1947952675] [2022-04-08 14:36:25,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1947952675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:25,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:25,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:25,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473856904] [2022-04-08 14:36:25,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:25,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 14:36:25,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:25,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:25,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:25,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:25,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:25,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:25,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:36:25,729 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:25,842 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 14:36:25,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:36:25,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 14:36:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:36:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:36:25,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 14:36:25,878 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-08 14:36:25,879 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:36:25,880 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:36:25,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:36:25,880 INFO L913 BasicCegarLoop]: 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-08 14:36:25,881 INFO L914 BasicCegarLoop]: 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-08 14:36:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:36:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-08 14:36:25,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:25,891 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-08 14:36:25,892 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-08 14:36:25,892 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-08 14:36:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:25,893 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:36:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:36:25,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:25,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:25,894 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-08 14:36:25,894 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-08 14:36:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:25,896 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:36:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:36:25,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:25,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:25,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:25,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:25,897 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-08 14:36:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-08 14:36:25,898 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-08 14:36:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:25,899 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-08 14:36:25,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:25,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-08 14:36:25,937 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-08 14:36:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-08 14:36:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:36:25,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:25,937 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:25,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:26,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:26,152 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-08 14:36:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:26,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [895088031] [2022-04-08 14:36:26,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-08 14:36:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:26,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762604868] [2022-04-08 14:36:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:26,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:26,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833404924] [2022-04-08 14:36:26,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:26,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:26,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:26,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:26,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:36:26,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:26,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:26,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:36:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:26,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:26,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-08 14:36:26,338 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-08 14:36:26,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:36:26,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-08 14:36:26,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-08 14:36:26,339 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-08 14:36:26,339 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-08 14:36:26,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:26,340 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-08 14:36:26,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-08 14:36:26,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-08 14:36:26,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:36:26,341 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-08 14:36:26,341 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-08 14:36:26,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-08 14:36:26,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-08 14:36:26,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:36:26,342 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-08 14:36:26,342 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-08 14:36:26,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:26,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-08 14:36:26,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-08 14:36:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:36:26,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:36:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:26,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762604868] [2022-04-08 14:36:26,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:26,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833404924] [2022-04-08 14:36:26,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833404924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:26,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:26,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:26,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:26,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [895088031] [2022-04-08 14:36:26,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [895088031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:26,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:26,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178564867] [2022-04-08 14:36:26,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:36:26,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:26,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:26,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:26,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:36:26,357 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-08 14:36:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:26,469 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 14:36:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:36:26,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:36:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:36:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:36:26,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 14:36:26,507 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-08 14:36:26,508 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:36:26,508 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:36:26,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:36:26,532 INFO L913 BasicCegarLoop]: 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-08 14:36:26,533 INFO L914 BasicCegarLoop]: 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-08 14:36:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:36:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:36:26,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:26,550 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-08 14:36:26,552 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-08 14:36:26,552 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-08 14:36:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:26,554 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 14:36:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:36:26,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:26,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:26,555 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-08 14:36:26,555 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-08 14:36:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:26,558 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 14:36:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:36:26,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:26,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:26,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:26,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:26,559 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-08 14:36:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-08 14:36:26,561 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-08 14:36:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:26,561 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-08 14:36:26,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:26,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-08 14:36:26,599 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-08 14:36:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:36:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:36:26,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:26,600 INFO L499 BasicCegarLoop]: 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-08 14:36:26,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:26,817 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:26,817 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-08 14:36:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:26,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [338163765] [2022-04-08 14:36:27,022 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:36:27,023 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:36:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 2 times [2022-04-08 14:36:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:27,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084557008] [2022-04-08 14:36:27,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:27,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:27,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127818376] [2022-04-08 14:36:27,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:27,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:27,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:27,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:27,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:36:27,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:27,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:27,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:36:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:27,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:27,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-08 14:36:27,194 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; {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:36:27,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(<= ~counter~0 0)} assume true; {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:36:27,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(<= ~counter~0 0)} {1211#true} #66#return; {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:36:27,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(<= ~counter~0 0)} call #t~ret6 := main(); {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:36:27,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#(<= ~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; {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:36:27,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,198 INFO L272 TraceCheckUtils]: 8: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,200 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #54#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,200 INFO L272 TraceCheckUtils]: 13: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,202 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #56#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,202 INFO L272 TraceCheckUtils]: 18: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,205 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #58#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {1235#(<= ~counter~0 1)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:36:27,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1290#(<= |main_#t~post5| 1)} is VALID [2022-04-08 14:36:27,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {1290#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1212#false} is VALID [2022-04-08 14:36:27,207 INFO L272 TraceCheckUtils]: 26: Hoare triple {1212#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1212#false} is VALID [2022-04-08 14:36:27,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2022-04-08 14:36:27,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2022-04-08 14:36:27,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-08 14:36:27,207 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-08 14:36:27,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:36:27,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-08 14:36:27,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2022-04-08 14:36:27,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2022-04-08 14:36:27,348 INFO L272 TraceCheckUtils]: 26: Hoare triple {1212#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1212#false} is VALID [2022-04-08 14:36:27,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {1318#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1212#false} is VALID [2022-04-08 14:36:27,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {1322#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1318#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:36:27,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {1322#(< ~counter~0 10)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1322#(< ~counter~0 10)} is VALID [2022-04-08 14:36:27,360 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1211#true} {1322#(< ~counter~0 10)} #58#return; {1322#(< ~counter~0 10)} is VALID [2022-04-08 14:36:27,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:27,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:27,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:27,361 INFO L272 TraceCheckUtils]: 18: Hoare triple {1322#(< ~counter~0 10)} 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-08 14:36:27,361 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1211#true} {1322#(< ~counter~0 10)} #56#return; {1322#(< ~counter~0 10)} is VALID [2022-04-08 14:36:27,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:27,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:27,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:27,362 INFO L272 TraceCheckUtils]: 13: Hoare triple {1322#(< ~counter~0 10)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1211#true} is VALID [2022-04-08 14:36:27,362 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1322#(< ~counter~0 10)} #54#return; {1322#(< ~counter~0 10)} is VALID [2022-04-08 14:36:27,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:27,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:27,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:27,363 INFO L272 TraceCheckUtils]: 8: Hoare triple {1322#(< ~counter~0 10)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1211#true} is VALID [2022-04-08 14:36:27,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {1322#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1322#(< ~counter~0 10)} is VALID [2022-04-08 14:36:27,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {1377#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1322#(< ~counter~0 10)} is VALID [2022-04-08 14:36:27,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1377#(< ~counter~0 9)} 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; {1377#(< ~counter~0 9)} is VALID [2022-04-08 14:36:27,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#(< ~counter~0 9)} call #t~ret6 := main(); {1377#(< ~counter~0 9)} is VALID [2022-04-08 14:36:27,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1377#(< ~counter~0 9)} {1211#true} #66#return; {1377#(< ~counter~0 9)} is VALID [2022-04-08 14:36:27,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {1377#(< ~counter~0 9)} assume true; {1377#(< ~counter~0 9)} is VALID [2022-04-08 14:36:27,365 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; {1377#(< ~counter~0 9)} is VALID [2022-04-08 14:36:27,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-08 14:36:27,365 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-08 14:36:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:27,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084557008] [2022-04-08 14:36:27,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:27,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127818376] [2022-04-08 14:36:27,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127818376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:36:27,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:36:27,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:36:27,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:27,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [338163765] [2022-04-08 14:36:27,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [338163765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:27,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:27,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:27,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545499750] [2022-04-08 14:36:27,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:27,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 14:36:27,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:27,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:27,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:27,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:36:27,382 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:27,465 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-08 14:36:27,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:36:27,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 14:36:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-08 14:36:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-08 14:36:27,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-04-08 14:36:27,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:27,501 INFO L225 Difference]: With dead ends: 50 [2022-04-08 14:36:27,501 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 14:36:27,502 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 14:36:27,502 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:27,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:36:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 14:36:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 14:36:27,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:27,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-08 14:36:27,520 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-08 14:36:27,520 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-08 14:36:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:27,522 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-08 14:36:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-08 14:36:27,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:27,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:27,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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 41 states. [2022-04-08 14:36:27,522 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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 41 states. [2022-04-08 14:36:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:27,524 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-08 14:36:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-08 14:36:27,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:27,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:27,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:27,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-08 14:36:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-04-08 14:36:27,525 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-04-08 14:36:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:27,526 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-04-08 14:36:27,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:27,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 47 transitions. [2022-04-08 14:36:27,563 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-08 14:36:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-08 14:36:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:36:27,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:27,564 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:27,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:27,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:27,764 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 1 times [2022-04-08 14:36:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:27,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921793683] [2022-04-08 14:36:27,928 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:36:27,928 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:36:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 2 times [2022-04-08 14:36:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:27,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830691524] [2022-04-08 14:36:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:27,949 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:27,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417539501] [2022-04-08 14:36:27,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:27,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:27,951 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:27,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:36:27,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:27,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:27,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:36:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:27,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:28,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-08 14:36:28,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#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; {1664#true} is VALID [2022-04-08 14:36:28,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:36:28,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #66#return; {1664#true} is VALID [2022-04-08 14:36:28,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret6 := main(); {1664#true} is VALID [2022-04-08 14:36:28,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#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; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:28,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:28,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:28,126 INFO L272 TraceCheckUtils]: 8: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1664#true} is VALID [2022-04-08 14:36:28,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:36:28,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:36:28,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:36:28,127 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1664#true} {1684#(and (= main_~a~0 0) (= main_~t~0 1))} #54#return; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:28,127 INFO L272 TraceCheckUtils]: 13: Hoare triple {1684#(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)); {1664#true} is VALID [2022-04-08 14:36:28,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:36:28,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:36:28,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:36:28,127 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1664#true} {1684#(and (= main_~a~0 0) (= main_~t~0 1))} #56#return; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:28,127 INFO L272 TraceCheckUtils]: 18: Hoare triple {1684#(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)); {1664#true} is VALID [2022-04-08 14:36:28,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:36:28,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:36:28,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:36:28,128 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1664#true} {1684#(and (= main_~a~0 0) (= main_~t~0 1))} #58#return; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:28,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {1684#(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; {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-08 14:36:28,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-08 14:36:28,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-08 14:36:28,130 INFO L272 TraceCheckUtils]: 26: Hoare triple {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:28,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:28,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {1753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-08 14:36:28,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-08 14:36:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:36:28,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:36:28,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-08 14:36:28,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {1753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-08 14:36:28,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:28,249 INFO L272 TraceCheckUtils]: 26: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:28,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {1769#(= 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; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,258 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1664#true} {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #58#return; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:36:28,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:36:28,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:36:28,258 INFO L272 TraceCheckUtils]: 18: Hoare triple {1769#(= 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)); {1664#true} is VALID [2022-04-08 14:36:28,259 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1664#true} {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #56#return; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:36:28,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:36:28,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:36:28,259 INFO L272 TraceCheckUtils]: 13: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1664#true} is VALID [2022-04-08 14:36:28,259 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1664#true} {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #54#return; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:36:28,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:36:28,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:36:28,260 INFO L272 TraceCheckUtils]: 8: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1664#true} is VALID [2022-04-08 14:36:28,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#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; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:28,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret6 := main(); {1664#true} is VALID [2022-04-08 14:36:28,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #66#return; {1664#true} is VALID [2022-04-08 14:36:28,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:36:28,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#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; {1664#true} is VALID [2022-04-08 14:36:28,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-08 14:36:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 14:36:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:28,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830691524] [2022-04-08 14:36:28,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:28,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417539501] [2022-04-08 14:36:28,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417539501] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:36:28,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:36:28,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:36:28,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1921793683] [2022-04-08 14:36:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1921793683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:28,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:28,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649473670] [2022-04-08 14:36:28,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:28,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 14:36:28,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:28,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:28,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:28,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:28,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:36:28,281 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:39,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:36:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:39,933 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-08 14:36:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:36:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 14:36:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:36:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:36:39,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:36:39,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:39,987 INFO L225 Difference]: With dead ends: 47 [2022-04-08 14:36:39,987 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 14:36:39,987 INFO L912 BasicCegarLoop]: 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-08 14:36:39,988 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 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-08 14:36:39,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2022-04-08 14:36:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 14:36:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 14:36:40,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:40,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-08 14:36:40,037 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-08 14:36:40,037 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-08 14:36:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:40,039 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:36:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-08 14:36:40,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:40,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:40,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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 45 states. [2022-04-08 14:36:40,039 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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 45 states. [2022-04-08 14:36:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:40,040 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:36:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-08 14:36:40,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:40,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:40,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:40,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-08 14:36:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-08 14:36:40,044 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2022-04-08 14:36:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:40,044 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-08 14:36:40,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:40,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 50 transitions. [2022-04-08 14:36:40,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-08 14:36:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 14:36:40,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:40,093 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:40,115 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-08 14:36:40,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:40,307 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:40,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 3 times [2022-04-08 14:36:40,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:40,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389703846] [2022-04-08 14:36:40,464 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:36:40,464 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:36:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 4 times [2022-04-08 14:36:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:40,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684266234] [2022-04-08 14:36:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:40,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:40,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57488012] [2022-04-08 14:36:40,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:36:40,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:40,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:40,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:40,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 14:36:40,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:36:40,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:40,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:36:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:40,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:40,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-08 14:36:40,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#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; {2126#true} is VALID [2022-04-08 14:36:40,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:36:40,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #66#return; {2126#true} is VALID [2022-04-08 14:36:40,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret6 := main(); {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#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; {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} assume !!(#t~post5 < 10);havoc #t~post5; {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L272 TraceCheckUtils]: 8: Hoare triple {2126#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2126#true} {2126#true} #54#return; {2126#true} is VALID [2022-04-08 14:36:40,707 INFO L272 TraceCheckUtils]: 13: Hoare triple {2126#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2126#true} is VALID [2022-04-08 14:36:40,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {2126#true} ~cond := #in~cond; {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:40,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:40,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:40,713 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} {2126#true} #56#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:40,713 INFO L272 TraceCheckUtils]: 18: Hoare triple {2184#(= (+ (* 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)); {2126#true} is VALID [2022-04-08 14:36:40,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-08 14:36:40,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-08 14:36:40,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:36:40,714 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2126#true} {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:40,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#(= (+ (* 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; {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:36:40,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:36:40,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:36:40,716 INFO L272 TraceCheckUtils]: 26: Hoare triple {2203#(= 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)); {2126#true} is VALID [2022-04-08 14:36:40,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {2126#true} ~cond := #in~cond; {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:40,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:40,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:40,718 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #54#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:40,719 INFO L272 TraceCheckUtils]: 31: Hoare triple {2184#(= (+ (* 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)); {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:40,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:40,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {2232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-08 14:36:40,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-08 14:36:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:36:40,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:36:41,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-08 14:36:41,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {2232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-08 14:36:41,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:41,039 INFO L272 TraceCheckUtils]: 31: Hoare triple {2184#(= (+ (* 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)); {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:41,040 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} {2251#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #54#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:41,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:41,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {2261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:41,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {2126#true} ~cond := #in~cond; {2261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:36:41,049 INFO L272 TraceCheckUtils]: 26: Hoare triple {2251#(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)); {2126#true} is VALID [2022-04-08 14:36:41,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {2251#(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 < 10);havoc #t~post5; {2251#(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-08 14:36:41,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {2251#(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; {2251#(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-08 14:36:41,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#(= (+ (* 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; {2251#(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-08 14:36:41,053 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2126#true} {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:41,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:36:41,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-08 14:36:41,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-08 14:36:41,054 INFO L272 TraceCheckUtils]: 18: Hoare triple {2184#(= (+ (* 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)); {2126#true} is VALID [2022-04-08 14:36:41,055 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} {2126#true} #56#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:41,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:41,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {2261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:41,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {2126#true} ~cond := #in~cond; {2261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:36:41,056 INFO L272 TraceCheckUtils]: 13: Hoare triple {2126#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2126#true} is VALID [2022-04-08 14:36:41,056 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2126#true} {2126#true} #54#return; {2126#true} is VALID [2022-04-08 14:36:41,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:36:41,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-08 14:36:41,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L272 TraceCheckUtils]: 8: Hoare triple {2126#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} assume !!(#t~post5 < 10);havoc #t~post5; {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#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; {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret6 := main(); {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #66#return; {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#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; {2126#true} is VALID [2022-04-08 14:36:41,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-08 14:36:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:36:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684266234] [2022-04-08 14:36:41,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57488012] [2022-04-08 14:36:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57488012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:36:41,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:36:41,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 14:36:41,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:41,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389703846] [2022-04-08 14:36:41,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389703846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:41,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:41,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:36:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794888755] [2022-04-08 14:36:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-08 14:36:41,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:41,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:41,081 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-08 14:36:41,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:36:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:36:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:36:41,082 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:41,570 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:36:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:36:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-08 14:36:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-08 14:36:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-08 14:36:41,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-08 14:36:41,599 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-08 14:36:41,600 INFO L225 Difference]: With dead ends: 45 [2022-04-08 14:36:41,600 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:36:41,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:36:41,601 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:41,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:36:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:36:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:36:41,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:41,601 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-08 14:36:41,602 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-08 14:36:41,602 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-08 14:36:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:41,602 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:36:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:36:41,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:41,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:41,602 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-08 14:36:41,602 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-08 14:36:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:41,602 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:36:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:36:41,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:41,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:41,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:41,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:41,603 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-08 14:36:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:36:41,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-08 14:36:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:41,603 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:36:41,603 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:41,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:36:41,603 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-08 14:36:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:36:41,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:41,605 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:36:41,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:41,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:41,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:36:42,213 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 14:36:42,214 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 14:36:42,214 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 14:36:42,214 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:36:42,214 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-08 14:36:42,214 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:36:42,214 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:36:42,214 INFO L878 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-08 14:36:42,214 INFO L878 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-08 14:36:42,214 INFO L878 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-08 14:36:42,214 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 21 49) the Hoare annotation is: true [2022-04-08 14:36:42,214 INFO L885 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-08 14:36:42,214 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 21 49) the Hoare annotation is: true [2022-04-08 14:36:42,214 INFO L878 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-08 14:36:42,215 INFO L878 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-08 14:36:42,215 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:42,215 INFO L878 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-08 14:36:42,215 INFO L878 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-08 14:36:42,215 INFO L878 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-08 14:36:42,215 INFO L878 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-08 14:36:42,215 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:36:42,215 INFO L878 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-08 14:36:42,215 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:36:42,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:36:42,215 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:36:42,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:36:42,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:36:42,215 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 14:36:42,215 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:36:42,216 INFO L878 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-08 14:36:42,216 INFO L878 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-08 14:36:42,216 INFO L878 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-08 14:36:42,216 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:36:42,218 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2] [2022-04-08 14:36:42,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:36:42,221 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:36:42,225 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 14:36:42,226 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:36:42,227 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 14:36:42,227 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 14:36:42,229 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-08 14:36:42,237 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-08 14:36:42,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:36:42 BoogieIcfgContainer [2022-04-08 14:36:42,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:36:42,247 INFO L158 Benchmark]: Toolchain (without parser) took 18935.68ms. Allocated memory was 170.9MB in the beginning and 221.2MB in the end (delta: 50.3MB). Free memory was 120.1MB in the beginning and 107.4MB in the end (delta: 12.7MB). Peak memory consumption was 63.7MB. Max. memory is 8.0GB. [2022-04-08 14:36:42,247 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:36:42,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.76ms. Allocated memory is still 170.9MB. Free memory was 120.0MB in the beginning and 145.7MB in the end (delta: -25.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:36:42,247 INFO L158 Benchmark]: Boogie Preprocessor took 34.04ms. Allocated memory is still 170.9MB. Free memory was 145.7MB in the beginning and 144.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 14:36:42,248 INFO L158 Benchmark]: RCFGBuilder took 286.28ms. Allocated memory is still 170.9MB. Free memory was 144.5MB in the beginning and 133.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:36:42,248 INFO L158 Benchmark]: TraceAbstraction took 18336.45ms. Allocated memory was 170.9MB in the beginning and 221.2MB in the end (delta: 50.3MB). Free memory was 132.9MB in the beginning and 107.4MB in the end (delta: 25.5MB). Peak memory consumption was 77.4MB. Max. memory is 8.0GB. [2022-04-08 14:36:42,250 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.13ms. Allocated memory is still 170.9MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.76ms. Allocated memory is still 170.9MB. Free memory was 120.0MB in the beginning and 145.7MB in the end (delta: -25.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.04ms. Allocated memory is still 170.9MB. Free memory was 145.7MB in the beginning and 144.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 286.28ms. Allocated memory is still 170.9MB. Free memory was 144.5MB in the beginning and 133.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18336.45ms. Allocated memory was 170.9MB in the beginning and 221.2MB in the end (delta: 50.3MB). Free memory was 132.9MB in the beginning and 107.4MB in the end (delta: 25.5MB). Peak memory consumption was 77.4MB. 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: 18.2s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 525 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 209 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 43, 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, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 164 PreInvPairs, 227 NumberOfFragments, 278 HoareAnnotationTreeSize, 164 FomulaSimplifications, 129 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 816 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-08 14:36:42,276 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...