/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-fb4f59a-m [2022-04-28 14:39:05,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:39:05,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:39:05,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:39:05,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:39:05,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:39:05,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:39:05,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:39:05,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:39:05,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:39:05,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:39:05,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:39:05,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:39:05,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:39:05,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:39:05,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:39:05,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:39:05,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:39:05,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:39:05,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:39:05,469 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:39:05,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:39:05,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:39:05,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:39:05,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:39:05,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:39:05,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:39:05,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:39:05,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:39:05,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:39:05,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:39:05,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:39:05,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:39:05,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:39:05,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:39:05,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:39:05,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:39:05,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:39:05,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:39:05,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:39:05,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:39:05,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:39:05,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:39:05,494 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:39:05,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:39:05,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:39:05,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:39:05,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:39:05,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:39:05,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:39:05,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:39:05,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:39:05,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:39:05,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:39:05,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:39:05,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:39:05,498 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:39:05,498 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:39:05,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:39:05,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:39:05,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:39:05,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:39:05,706 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:39:05,706 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-28 14:39:05,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4b21aad/bb126ee58dd1429281475e408fa3a596/FLAG254b61ba4 [2022-04-28 14:39:06,102 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:39:06,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2022-04-28 14:39:06,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4b21aad/bb126ee58dd1429281475e408fa3a596/FLAG254b61ba4 [2022-04-28 14:39:06,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4b21aad/bb126ee58dd1429281475e408fa3a596 [2022-04-28 14:39:06,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:39:06,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:39:06,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:39:06,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:39:06,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:39:06,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382feead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06, skipping insertion in model container [2022-04-28 14:39:06,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:39:06,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:39:06,672 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-28 14:39:06,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:39:06,690 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:39:06,697 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-28 14:39:06,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:39:06,711 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:39:06,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06 WrapperNode [2022-04-28 14:39:06,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:39:06,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:39:06,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:39:06,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:39:06,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:39:06,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:39:06,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:39:06,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:39:06,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (1/1) ... [2022-04-28 14:39:06,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:39:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:06,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:39:06,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:39:06,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:39:06,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:39:06,778 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:39:06,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:39:06,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:39:06,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:39:06,778 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:39:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:39:06,820 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:39:06,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:39:06,974 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:39:06,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:39:06,980 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:39:06,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:39:06 BoogieIcfgContainer [2022-04-28 14:39:06,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:39:06,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:39:06,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:39:06,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:39:06,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:39:06" (1/3) ... [2022-04-28 14:39:06,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162b8f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:39:06, skipping insertion in model container [2022-04-28 14:39:06,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:06" (2/3) ... [2022-04-28 14:39:06,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162b8f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:39:06, skipping insertion in model container [2022-04-28 14:39:06,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:39:06" (3/3) ... [2022-04-28 14:39:06,994 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound10.c [2022-04-28 14:39:07,004 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:39:07,004 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:39:07,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:39:07,043 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73a98ab4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e3d9b2a [2022-04-28 14:39:07,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:39:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:39:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 14:39:07,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:07,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:07,057 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-28 14:39:07,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:07,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702036083] [2022-04-28 14:39:07,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-28 14:39:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:07,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052979221] [2022-04-28 14:39:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:39:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:07,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-28 14:39:07,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 14:39:07,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 14:39:07,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:39:07,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-28 14:39:07,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 14:39:07,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 14:39:07,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-28 14:39:07,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-28 14:39:07,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 14:39:07,245 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-28 14:39:07,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 14:39:07,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 14:39:07,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 14:39:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:39:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:07,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052979221] [2022-04-28 14:39:07,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052979221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:07,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:07,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:39:07,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:07,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702036083] [2022-04-28 14:39:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702036083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:07,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:07,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:39:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642202444] [2022-04-28 14:39:07,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:07,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 14:39:07,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:07,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:07,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:39:07,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:39:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:39:07,302 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:07,446 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-28 14:39:07,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:39:07,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 14:39:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 14:39:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 14:39:07,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 14:39:07,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:07,547 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:39:07,548 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 14:39:07,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:39:07,553 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:07,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:39:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 14:39:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 14:39:07,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:07,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:39:07,576 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:39:07,576 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:39:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:07,579 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 14:39:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 14:39:07,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:07,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:07,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-28 14:39:07,580 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-28 14:39:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:07,583 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 14:39:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 14:39:07,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:07,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:07,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:07,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:39:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-28 14:39:07,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-28 14:39:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:07,588 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-28 14:39:07,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-28 14:39:07,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 14:39:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:39:07,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:07,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:07,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:39:07,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-28 14:39:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:07,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152612764] [2022-04-28 14:39:07,644 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-28 14:39:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:07,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155022635] [2022-04-28 14:39:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:07,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:39:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:07,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:07,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:07,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:07,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:39:07,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:07,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:07,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:07,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:07,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:07,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {223#(= |main_#t~post5| 0)} is VALID [2022-04-28 14:39:07,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {218#false} is VALID [2022-04-28 14:39:07,739 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {218#false} is VALID [2022-04-28 14:39:07,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-28 14:39:07,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-28 14:39:07,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-28 14:39:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:39:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:07,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155022635] [2022-04-28 14:39:07,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155022635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:07,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:07,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:39:07,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:07,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152612764] [2022-04-28 14:39:07,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152612764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:07,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:07,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:39:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746849370] [2022-04-28 14:39:07,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:39:07,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:07,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:07,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:07,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:07,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:39:07,757 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:07,910 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 14:39:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:39:07,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:39:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 14:39:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 14:39:07,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 14:39:07,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:07,962 INFO L225 Difference]: With dead ends: 32 [2022-04-28 14:39:07,963 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 14:39:07,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:39:07,967 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:07,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:39:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 14:39:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 14:39:07,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:07,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:39:07,979 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:39:07,979 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:39:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:07,984 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 14:39:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:39:07,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:07,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:07,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-28 14:39:07,987 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-28 14:39:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:07,990 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 14:39:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:39:07,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:07,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:07,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:07,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:39:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 14:39:07,996 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-28 14:39:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:07,996 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 14:39:07,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:07,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-28 14:39:08,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:39:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:39:08,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:08,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:08,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:39:08,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-28 14:39:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:08,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258390659] [2022-04-28 14:39:08,039 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-28 14:39:08,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:08,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296834507] [2022-04-28 14:39:08,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:08,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:08,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:39:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:08,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-28 14:39:08,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 14:39:08,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 14:39:08,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:39:08,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-28 14:39:08,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 14:39:08,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 14:39:08,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 14:39:08,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:39:08,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:39:08,112 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-28 14:39:08,114 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:08,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:39:08,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-28 14:39:08,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 14:39:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:39:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:08,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296834507] [2022-04-28 14:39:08,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296834507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:08,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:08,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:39:08,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:08,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258390659] [2022-04-28 14:39:08,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258390659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:08,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:08,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:39:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095305223] [2022-04-28 14:39:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:39:08,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:08,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:08,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:08,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:39:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:08,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:39:08,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:39:08,130 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:08,427 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 14:39:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:39:08,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:39:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 14:39:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 14:39:08,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 14:39:08,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:08,479 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:39:08,479 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:39:08,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:39:08,480 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:08,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:39:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:39:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 14:39:08,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:08,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:39:08,485 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:39:08,485 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:39:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:08,487 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 14:39:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 14:39:08,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:08,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:08,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 14:39:08,490 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 14:39:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:08,492 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 14:39:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 14:39:08,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:08,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:08,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:08,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:39:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 14:39:08,494 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 14:39:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:08,495 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 14:39:08,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:39:08,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 14:39:08,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 14:39:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:39:08,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:08,529 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:08,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 14:39:08,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-28 14:39:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:08,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [58190571] [2022-04-28 14:39:08,530 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-28 14:39:08,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:08,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076922020] [2022-04-28 14:39:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:08,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:08,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [727227443] [2022-04-28 14:39:08,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:39:08,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:08,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:08,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:08,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:39:08,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:39:08,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:08,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:39:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:08,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:08,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-28 14:39:08,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {608#true} is VALID [2022-04-28 14:39:08,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 14:39:08,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-28 14:39:08,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-28 14:39:08,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:39:08,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:39:08,698 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-28 14:39:08,698 INFO L272 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {608#true} is VALID [2022-04-28 14:39:08,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-28 14:39:08,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-28 14:39:08,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 14:39:08,699 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {608#true} {628#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:39:08,700 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:08,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:08,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-28 14:39:08,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-28 14:39:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:39:08,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:39:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076922020] [2022-04-28 14:39:08,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727227443] [2022-04-28 14:39:08,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727227443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:08,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:08,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:08,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:08,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [58190571] [2022-04-28 14:39:08,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [58190571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:08,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:08,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:08,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949896875] [2022-04-28 14:39:08,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:08,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 14:39:08,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:08,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:39:08,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:08,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:08,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:08,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:08,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:39:08,717 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:39:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:08,841 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 14:39:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:08,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 14:39:08,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:39:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:39:08,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-28 14:39:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:39:08,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 14:39:08,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:08,882 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:39:08,882 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:39:08,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:39:08,883 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:08,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:39:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:39:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 14:39:08,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:08,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:39:08,894 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:39:08,894 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:39:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:08,896 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:39:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:39:08,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:08,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:08,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:39:08,897 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:39:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:08,899 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:39:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:39:08,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:08,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:08,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:08,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:39:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 14:39:08,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-28 14:39:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:08,901 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 14:39:08,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:39:08,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 14:39:08,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 14:39:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:39:08,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:08,943 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:08,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:09,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:09,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-28 14:39:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:09,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [957870095] [2022-04-28 14:39:09,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-28 14:39:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:09,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638428489] [2022-04-28 14:39:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:09,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:09,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1687429346] [2022-04-28 14:39:09,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:39:09,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:09,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:09,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:39:09,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:39:09,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:09,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:39:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:09,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:09,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-28 14:39:09,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {895#true} is VALID [2022-04-28 14:39:09,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:39:09,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-28 14:39:09,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-28 14:39:09,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:39:09,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:39:09,353 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-28 14:39:09,353 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {895#true} is VALID [2022-04-28 14:39:09,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 14:39:09,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 14:39:09,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:39:09,354 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:39:09,354 INFO L272 TraceCheckUtils]: 13: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {895#true} is VALID [2022-04-28 14:39:09,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 14:39:09,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 14:39:09,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:39:09,358 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:39:09,359 INFO L272 TraceCheckUtils]: 18: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:09,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:09,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-28 14:39:09,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-28 14:39:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:39:09,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:39:09,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:09,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638428489] [2022-04-28 14:39:09,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:09,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687429346] [2022-04-28 14:39:09,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687429346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:09,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:09,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:09,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:09,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [957870095] [2022-04-28 14:39:09,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [957870095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:09,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:09,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:09,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012059631] [2022-04-28 14:39:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:39:09,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:09,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:39:09,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:09,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:09,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:09,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:39:09,376 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:39:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:09,526 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 14:39:09,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:09,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:39:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:39:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:39:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:39:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:39:09,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 14:39:09,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-28 14:39:09,565 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:39:09,565 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 14:39:09,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:39:09,568 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:09,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:39:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 14:39:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 14:39:09,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:09,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:39:09,582 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:39:09,582 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:39:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:09,584 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 14:39:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:39:09,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:09,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:09,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-28 14:39:09,585 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-28 14:39:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:09,588 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 14:39:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:39:09,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:09,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:09,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:09,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:39:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 14:39:09,590 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-28 14:39:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:09,590 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 14:39:09,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:39:09,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-28 14:39:09,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:39:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:39:09,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:09,625 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:09,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:09,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:09,836 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-28 14:39:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:09,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843215393] [2022-04-28 14:39:10,086 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:39:10,087 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:39:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 2 times [2022-04-28 14:39:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:10,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027052897] [2022-04-28 14:39:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:10,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:10,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660595025] [2022-04-28 14:39:10,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:39:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:10,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:10,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:39:10,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:39:10,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:10,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:39:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:10,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:10,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 14:39:10,266 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-28 14:39:10,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(<= ~counter~0 0)} assume true; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:10,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(<= ~counter~0 0)} {1211#true} #66#return; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:10,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(<= ~counter~0 0)} call #t~ret6 := main(); {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:10,267 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-28 14:39:10,268 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-28 14:39:10,268 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-28 14:39:10,269 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-28 14:39:10,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,270 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #54#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,270 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-28 14:39:10,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,272 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #56#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,274 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-28 14:39:10,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,276 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #58#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:10,276 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-28 14:39:10,277 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-28 14:39:10,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {1290#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1212#false} is VALID [2022-04-28 14:39:10,277 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-28 14:39:10,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2022-04-28 14:39:10,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 14:39:10,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 14:39:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:39:10,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:39:10,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 14:39:10,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 14:39:10,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2022-04-28 14:39:10,432 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-28 14:39:10,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {1318#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1212#false} is VALID [2022-04-28 14:39:10,435 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-28 14:39:10,435 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-28 14:39:10,436 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1211#true} {1322#(< ~counter~0 10)} #58#return; {1322#(< ~counter~0 10)} is VALID [2022-04-28 14:39:10,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:39:10,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:39:10,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:39:10,436 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-28 14:39:10,437 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1211#true} {1322#(< ~counter~0 10)} #56#return; {1322#(< ~counter~0 10)} is VALID [2022-04-28 14:39:10,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:39:10,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:39:10,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:39:10,437 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-28 14:39:10,438 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1322#(< ~counter~0 10)} #54#return; {1322#(< ~counter~0 10)} is VALID [2022-04-28 14:39:10,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:39:10,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:39:10,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:39:10,438 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-28 14:39:10,439 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-28 14:39:10,439 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-28 14:39:10,440 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-28 14:39:10,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#(< ~counter~0 9)} call #t~ret6 := main(); {1377#(< ~counter~0 9)} is VALID [2022-04-28 14:39:10,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1377#(< ~counter~0 9)} {1211#true} #66#return; {1377#(< ~counter~0 9)} is VALID [2022-04-28 14:39:10,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {1377#(< ~counter~0 9)} assume true; {1377#(< ~counter~0 9)} is VALID [2022-04-28 14:39:10,441 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-28 14:39:10,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 14:39:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:39:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:10,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027052897] [2022-04-28 14:39:10,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:10,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660595025] [2022-04-28 14:39:10,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660595025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:39:10,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:39:10,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 14:39:10,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:10,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843215393] [2022-04-28 14:39:10,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843215393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:10,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:10,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845968525] [2022-04-28 14:39:10,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:10,443 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-28 14:39:10,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:10,443 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-28 14:39:10,457 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-28 14:39:10,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:10,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:39:10,458 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-28 14:39:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:10,554 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-28 14:39:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:39:10,554 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-28 14:39:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:10,555 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-28 14:39:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-28 14:39:10,556 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-28 14:39:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-28 14:39:10,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-04-28 14:39:10,590 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-28 14:39:10,591 INFO L225 Difference]: With dead ends: 50 [2022-04-28 14:39:10,591 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 14:39:10,591 INFO L412 NwaCegarLoop]: 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-28 14:39:10,591 INFO L413 NwaCegarLoop]: 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-28 14:39:10,592 INFO L414 NwaCegarLoop]: 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-28 14:39:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 14:39:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 14:39:10,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:10,612 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-28 14:39:10,612 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-28 14:39:10,613 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-28 14:39:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:10,614 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-28 14:39:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 14:39:10,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:10,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:10,614 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-28 14:39:10,615 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-28 14:39:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:10,616 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-28 14:39:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 14:39:10,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:10,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:10,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:10,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:10,616 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-28 14:39:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-04-28 14:39:10,617 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-04-28 14:39:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:10,618 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-04-28 14:39:10,618 INFO L496 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-28 14:39:10,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 47 transitions. [2022-04-28 14:39:10,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 14:39:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:39:10,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:10,653 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:10,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:10,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:10,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 1 times [2022-04-28 14:39:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:10,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213638138] [2022-04-28 14:39:11,042 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:39:11,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:39:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 2 times [2022-04-28 14:39:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:11,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020488479] [2022-04-28 14:39:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:11,073 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:11,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347980039] [2022-04-28 14:39:11,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:39:11,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:11,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:11,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:11,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:39:11,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:39:11,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:11,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:39:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:11,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:11,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-28 14:39:11,230 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-28 14:39:11,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 14:39:11,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #66#return; {1664#true} is VALID [2022-04-28 14:39:11,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret6 := main(); {1664#true} is VALID [2022-04-28 14:39:11,231 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-28 14:39:11,232 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-28 14:39:11,232 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-28 14:39:11,232 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-28 14:39:11,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-28 14:39:11,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-28 14:39:11,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 14:39:11,233 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-28 14:39:11,233 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-28 14:39:11,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-28 14:39:11,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-28 14:39:11,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 14:39:11,234 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-28 14:39:11,234 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-28 14:39:11,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-28 14:39:11,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-28 14:39:11,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 14:39:11,234 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-28 14:39:11,235 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-28 14:39:11,235 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-28 14:39:11,236 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-28 14:39:11,237 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-28 14:39:11,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:11,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {1753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-28 14:39:11,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-28 14:39:11,238 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-28 14:39:11,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:39:11,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-28 14:39:11,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {1753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-28 14:39:11,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:11,364 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-28 14:39:11,364 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-28 14:39:11,365 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-28 14:39:11,366 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-28 14:39:11,367 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-28 14:39:11,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 14:39:11,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-28 14:39:11,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-28 14:39:11,368 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-28 14:39:11,368 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-28 14:39:11,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 14:39:11,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-28 14:39:11,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-28 14:39:11,368 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-28 14:39:11,369 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-28 14:39:11,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 14:39:11,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-28 14:39:11,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-28 14:39:11,369 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-28 14:39:11,370 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-28 14:39:11,370 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-28 14:39:11,370 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-28 14:39:11,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret6 := main(); {1664#true} is VALID [2022-04-28 14:39:11,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #66#return; {1664#true} is VALID [2022-04-28 14:39:11,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 14:39:11,374 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-28 14:39:11,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-28 14:39:11,374 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-28 14:39:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:11,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020488479] [2022-04-28 14:39:11,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:11,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347980039] [2022-04-28 14:39:11,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347980039] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:39:11,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:39:11,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:39:11,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:11,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213638138] [2022-04-28 14:39:11,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213638138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:11,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:11,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462003426] [2022-04-28 14:39:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:11,376 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-28 14:39:11,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:11,376 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-28 14:39:11,389 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-28 14:39:11,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:11,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:11,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:39:11,390 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-28 14:39:23,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:39:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:23,002 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-28 14:39:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:23,003 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-28 14:39:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:23,003 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-28 14:39:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:39:23,004 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-28 14:39:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:39:23,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 14:39:23,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:23,037 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:39:23,037 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 14:39:23,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:39:23,037 INFO L413 NwaCegarLoop]: 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-28 14:39:23,038 INFO L414 NwaCegarLoop]: 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-28 14:39:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 14:39:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 14:39:23,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:23,097 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-28 14:39:23,097 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-28 14:39:23,098 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-28 14:39:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:23,099 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 14:39:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 14:39:23,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:23,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:23,099 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-28 14:39:23,100 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-28 14:39:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:23,101 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 14:39:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 14:39:23,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:23,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:23,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:23,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:23,101 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-28 14:39:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-28 14:39:23,102 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2022-04-28 14:39:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:23,102 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-28 14:39:23,103 INFO L496 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-28 14:39:23,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 50 transitions. [2022-04-28 14:39:23,147 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-28 14:39:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 14:39:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:39:23,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:23,148 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:23,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:23,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:23,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 3 times [2022-04-28 14:39:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [969277217] [2022-04-28 14:39:23,505 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:39:23,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:39:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 4 times [2022-04-28 14:39:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:23,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965545470] [2022-04-28 14:39:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:23,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:23,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028931399] [2022-04-28 14:39:23,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:39:23,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:23,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:23,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:23,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:39:23,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:39:23,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:23,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 14:39:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:23,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:23,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-28 14:39:23,762 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-28 14:39:23,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 14:39:23,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #66#return; {2126#true} is VALID [2022-04-28 14:39:23,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret6 := main(); {2126#true} is VALID [2022-04-28 14:39:23,763 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-28 14:39:23,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2126#true} is VALID [2022-04-28 14:39:23,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} assume !!(#t~post5 < 10);havoc #t~post5; {2126#true} is VALID [2022-04-28 14:39:23,763 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-28 14:39:23,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-28 14:39:23,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-28 14:39:23,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 14:39:23,764 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2126#true} {2126#true} #54#return; {2126#true} is VALID [2022-04-28 14:39:23,764 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-28 14:39:23,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {2126#true} ~cond := #in~cond; {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:23,764 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-28 14:39:23,765 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-28 14:39:23,765 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-28 14:39:23,765 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-28 14:39:23,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-28 14:39:23,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-28 14:39:23,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 14:39:23,766 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-28 14:39:23,768 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-28 14:39:23,768 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-28 14:39:23,768 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-28 14:39:23,768 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-28 14:39:23,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {2126#true} ~cond := #in~cond; {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:23,769 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-28 14:39:23,769 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-28 14:39:23,770 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-28 14:39:23,771 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-28 14:39:23,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:23,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {2232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-28 14:39:23,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-28 14:39:23,773 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-28 14:39:23,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:39:24,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-28 14:39:24,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {2232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-28 14:39:24,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:24,057 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-28 14:39:24,059 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-28 14:39:24,060 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-28 14:39:24,060 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-28 14:39:24,062 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-28 14:39:24,062 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-28 14:39:24,062 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-28 14:39:24,063 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-28 14:39:24,065 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-28 14:39:24,066 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-28 14:39:24,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 14:39:24,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-28 14:39:24,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-28 14:39:24,067 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-28 14:39:24,069 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-28 14:39:24,069 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-28 14:39:24,070 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-28 14:39:24,070 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-28 14:39:24,070 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-28 14:39:24,070 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2126#true} {2126#true} #54#return; {2126#true} is VALID [2022-04-28 14:39:24,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 14:39:24,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-28 14:39:24,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-28 14:39:24,071 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-28 14:39:24,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} assume !!(#t~post5 < 10);havoc #t~post5; {2126#true} is VALID [2022-04-28 14:39:24,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2126#true} is VALID [2022-04-28 14:39:24,071 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-28 14:39:24,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret6 := main(); {2126#true} is VALID [2022-04-28 14:39:24,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #66#return; {2126#true} is VALID [2022-04-28 14:39:24,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 14:39:24,071 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-28 14:39:24,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-28 14:39:24,071 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-28 14:39:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:24,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965545470] [2022-04-28 14:39:24,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:24,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028931399] [2022-04-28 14:39:24,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028931399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:39:24,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:39:24,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 14:39:24,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:24,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [969277217] [2022-04-28 14:39:24,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [969277217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:24,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:24,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:39:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618465634] [2022-04-28 14:39:24,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:24,073 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-28 14:39:24,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:24,073 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-28 14:39:24,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:24,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:39:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:39:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:39:24,098 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-28 14:39:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:24,566 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 14:39:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:24,566 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-28 14:39:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:24,566 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-28 14:39:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 14:39:24,567 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-28 14:39:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 14:39:24,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-28 14:39:24,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:24,598 INFO L225 Difference]: With dead ends: 45 [2022-04-28 14:39:24,598 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:39:24,599 INFO L412 NwaCegarLoop]: 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-28 14:39:24,599 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:24,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:39:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:39:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:39:24,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:24,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:24,600 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:24,600 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:24,600 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:39:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:24,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:24,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:24,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:39:24,600 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:39:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:24,601 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:39:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:24,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:24,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:24,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:24,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:39:24,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-28 14:39:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:24,601 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:39:24,601 INFO L496 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-28 14:39:24,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:39:24,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:24,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:24,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:39:24,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:24,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:24,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:39:25,251 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:39:25,251 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:39:25,251 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:39:25,251 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:25,251 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-28 14:39:25,251 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:25,251 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:25,251 INFO L895 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 21 49) the Hoare annotation is: true [2022-04-28 14:39:25,252 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-28 14:39:25,252 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 21 49) the Hoare annotation is: true [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point L30-1(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:25,252 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:39:25,253 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:25,253 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:39:25,253 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:25,253 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:39:25,253 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:39:25,253 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:39:25,253 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:39:25,253 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:25,253 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:25,253 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:25,253 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:39:25,255 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2] [2022-04-28 14:39:25,257 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:39:25,261 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:39:25,276 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 14:39:25,277 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:39:25,277 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 14:39:25,277 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 14:39:25,279 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 14:39:25,285 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:39:25,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:39:25 BoogieIcfgContainer [2022-04-28 14:39:25,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:39:25,298 INFO L158 Benchmark]: Toolchain (without parser) took 18759.21ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 129.4MB in the beginning and 75.0MB in the end (delta: 54.4MB). Peak memory consumption was 89.8MB. Max. memory is 8.0GB. [2022-04-28 14:39:25,298 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:39:25,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.81ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 154.1MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:39:25,298 INFO L158 Benchmark]: Boogie Preprocessor took 19.19ms. Allocated memory is still 178.3MB. Free memory was 153.7MB in the beginning and 152.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:39:25,299 INFO L158 Benchmark]: RCFGBuilder took 257.11ms. Allocated memory is still 178.3MB. Free memory was 152.2MB in the beginning and 141.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 14:39:25,299 INFO L158 Benchmark]: TraceAbstraction took 18307.10ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 141.1MB in the beginning and 75.0MB in the end (delta: 66.1MB). Peak memory consumption was 102.7MB. Max. memory is 8.0GB. [2022-04-28 14:39:25,301 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.14ms. Allocated memory is still 178.3MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.81ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 154.1MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.19ms. Allocated memory is still 178.3MB. Free memory was 153.7MB in the beginning and 152.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 257.11ms. Allocated memory is still 178.3MB. Free memory was 152.2MB in the beginning and 141.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18307.10ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 141.1MB in the beginning and 75.0MB in the end (delta: 66.1MB). Peak memory consumption was 102.7MB. 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, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 525 SdHoareTripleChecker+Invalid, 8.3s 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.2s 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-28 14:39:25,325 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...