/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:37:06,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:37:06,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:37:06,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:37:06,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:37:06,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:37:06,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:37:06,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:37:06,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:37:06,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:37:06,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:37:06,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:37:06,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:37:06,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:37:06,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:37:06,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:37:06,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:37:06,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:37:06,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:37:06,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:37:06,345 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:37:06,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:37:06,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:37:06,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:37:06,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:37:06,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:37:06,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:37:06,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:37:06,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:37:06,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:37:06,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:37:06,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:37:06,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:37:06,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:37:06,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:37:06,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:37:06,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:37:06,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:37:06,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:37:06,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:37:06,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:37:06,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:37:06,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:37:06,368 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:37:06,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:37:06,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:37:06,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:37:06,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:37:06,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:37:06,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:37:06,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:37:06,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:37:06,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:37:06,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:37:06,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:37:06,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:37:06,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:37:06,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:37:06,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:37:06,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:37:06,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:37:06,371 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:37:06,371 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:37:06,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:37:06,371 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:37:06,371 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:37:06,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:37:06,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:37:06,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:37:06,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:37:06,556 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:37:06,557 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-08 14:37:06,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479076fb0/aed892d08f374f7788fbc65d6b4d5b5f/FLAGd35cbdde7 [2022-04-08 14:37:06,955 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:37:06,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-08 14:37:06,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479076fb0/aed892d08f374f7788fbc65d6b4d5b5f/FLAGd35cbdde7 [2022-04-08 14:37:06,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479076fb0/aed892d08f374f7788fbc65d6b4d5b5f [2022-04-08 14:37:06,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:37:06,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:37:06,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:37:06,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:37:06,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:37:06,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:37:06" (1/1) ... [2022-04-08 14:37:06,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17772879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:06, skipping insertion in model container [2022-04-08 14:37:06,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:37:06" (1/1) ... [2022-04-08 14:37:06,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:37:07,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:37:07,135 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_unwindbound20.c[520,533] [2022-04-08 14:37:07,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:37:07,189 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:37:07,197 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_unwindbound20.c[520,533] [2022-04-08 14:37:07,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:37:07,211 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:37:07,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07 WrapperNode [2022-04-08 14:37:07,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:37:07,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:37:07,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:37:07,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:37:07,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (1/1) ... [2022-04-08 14:37:07,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (1/1) ... [2022-04-08 14:37:07,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (1/1) ... [2022-04-08 14:37:07,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (1/1) ... [2022-04-08 14:37:07,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (1/1) ... [2022-04-08 14:37:07,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (1/1) ... [2022-04-08 14:37:07,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (1/1) ... [2022-04-08 14:37:07,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:37:07,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:37:07,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:37:07,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:37:07,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (1/1) ... [2022-04-08 14:37:07,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:37:07,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:07,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:37:07,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:37:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:37:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:37:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:37:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:37:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:37:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:37:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:37:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:37:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:37:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:37:07,337 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:37:07,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:37:07,488 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:37:07,493 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:37:07,493 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:37:07,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:37:07 BoogieIcfgContainer [2022-04-08 14:37:07,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:37:07,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:37:07,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:37:07,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:37:07,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:37:06" (1/3) ... [2022-04-08 14:37:07,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3f587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:37:07, skipping insertion in model container [2022-04-08 14:37:07,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:07" (2/3) ... [2022-04-08 14:37:07,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3f587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:37:07, skipping insertion in model container [2022-04-08 14:37:07,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:37:07" (3/3) ... [2022-04-08 14:37:07,508 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound20.c [2022-04-08 14:37:07,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:37:07,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:37:07,550 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:37:07,555 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:37:07,555 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:37:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:37:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 14:37:07,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:07,572 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:07,573 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-08 14:37:07,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:07,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019960704] [2022-04-08 14:37:07,590 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-08 14:37:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:07,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783277847] [2022-04-08 14:37:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:07,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:37:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:07,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-08 14:37:07,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 14:37:07,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-08 14:37:07,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:37:07,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-08 14:37:07,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 14:37:07,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-08 14:37:07,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-08 14:37:07,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-08 14:37:07,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-08 14:37:07,751 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-08 14:37:07,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-08 14:37:07,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-08 14:37:07,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 14:37:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783277847] [2022-04-08 14:37:07,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783277847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:07,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:07,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:37:07,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:07,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019960704] [2022-04-08 14:37:07,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019960704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:07,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:07,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:37:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171769901] [2022-04-08 14:37:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 14:37:07,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:07,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:07,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:07,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:37:07,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:07,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:37:07,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:37:07,811 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:07,985 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-08 14:37:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:37:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 14:37:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 14:37:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 14:37:08,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 14:37:08,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:08,105 INFO L225 Difference]: With dead ends: 47 [2022-04-08 14:37:08,105 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 14:37:08,108 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:37:08,111 INFO L913 BasicCegarLoop]: 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-08 14:37:08,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 14:37:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 14:37:08,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:08,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:37:08,141 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:37:08,142 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:37:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:08,149 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 14:37:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 14:37:08,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:08,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:08,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-08 14:37:08,151 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-08 14:37:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:08,160 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 14:37:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 14:37:08,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:08,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:08,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:08,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:37:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-08 14:37:08,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-08 14:37:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:08,168 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-08 14:37:08,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-08 14:37:08,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-08 14:37:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:37:08,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:08,193 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:08,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:37:08,194 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-08 14:37:08,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:08,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289105649] [2022-04-08 14:37:08,195 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-08 14:37:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:08,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591132291] [2022-04-08 14:37:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:37:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:08,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:37:08,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:37:08,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:37:08,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:37:08,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:37:08,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:37:08,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:37:08,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-08 14:37:08,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:37:08,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {223#(= |main_#t~post5| 0)} is VALID [2022-04-08 14:37:08,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {218#false} is VALID [2022-04-08 14:37:08,261 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {218#false} is VALID [2022-04-08 14:37:08,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-08 14:37:08,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-08 14:37:08,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-08 14:37:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:08,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:08,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591132291] [2022-04-08 14:37:08,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591132291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:08,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:08,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:37:08,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:08,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289105649] [2022-04-08 14:37:08,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289105649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:08,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:08,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:37:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775101736] [2022-04-08 14:37:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:08,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:37:08,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:08,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:08,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:08,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:08,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:37:08,275 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:08,403 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 14:37:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:37:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:37:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:37:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:37:08,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 14:37:08,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:08,457 INFO L225 Difference]: With dead ends: 32 [2022-04-08 14:37:08,458 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 14:37:08,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:37:08,461 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:08,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 14:37:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 14:37:08,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:08,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:37:08,471 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:37:08,472 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:37:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:08,474 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 14:37:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:37:08,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:08,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:08,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-08 14:37:08,476 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-08 14:37:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:08,479 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 14:37:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:37:08,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:08,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:08,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:08,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:37:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-08 14:37:08,483 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-08 14:37:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:08,483 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-08 14:37:08,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-08 14:37:08,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:37:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:37:08,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:08,518 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:08,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:37:08,519 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:08,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-08 14:37:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962867355] [2022-04-08 14:37:08,523 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-08 14:37:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:08,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51572346] [2022-04-08 14:37:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:08,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:37:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:08,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-08 14:37:08,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 14:37:08,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-08 14:37:08,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:37:08,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-08 14:37:08,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 14:37:08,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-08 14:37:08,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-08 14:37:08,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:37:08,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:37:08,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:37:08,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:08,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:37:08,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-08 14:37:08,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-08 14:37:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:08,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51572346] [2022-04-08 14:37:08,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51572346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:08,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:08,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:37:08,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:08,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962867355] [2022-04-08 14:37:08,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962867355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:08,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:08,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:37:08,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448234960] [2022-04-08 14:37:08,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:08,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:37:08,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:08,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:08,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:37:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:08,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:37:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:37:08,646 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:08,927 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 14:37:08,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:37:08,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:37:08,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 14:37:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 14:37:08,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 14:37:08,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:08,986 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:37:08,987 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 14:37:08,987 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:37:08,989 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:08,997 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:37:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 14:37:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 14:37:09,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:09,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:09,004 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:09,004 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:09,006 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 14:37:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 14:37:09,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:09,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:09,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 14:37:09,007 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 14:37:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:09,008 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 14:37:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 14:37:09,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:09,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:09,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:09,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 14:37:09,011 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 14:37:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:09,011 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 14:37:09,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:37:09,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 14:37:09,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 14:37:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:37:09,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:09,043 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:09,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:37:09,043 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-08 14:37:09,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:09,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [497269381] [2022-04-08 14:37:09,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-08 14:37:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:09,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404927164] [2022-04-08 14:37:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:09,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:09,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733776372] [2022-04-08 14:37:09,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:09,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:09,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:09,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:09,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:37:09,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:09,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:09,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:37:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:09,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:09,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-08 14:37:09,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {608#true} is VALID [2022-04-08 14:37:09,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 14:37:09,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-08 14:37:09,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-08 14:37:09,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,247 INFO L272 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {608#true} is VALID [2022-04-08 14:37:09,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-08 14:37:09,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-08 14:37:09,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 14:37:09,248 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {608#true} {628#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,249 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:09,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:09,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-08 14:37:09,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-08 14:37:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:09,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:37:09,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:09,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404927164] [2022-04-08 14:37:09,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:09,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733776372] [2022-04-08 14:37:09,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733776372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:09,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:09,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:09,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:09,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [497269381] [2022-04-08 14:37:09,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [497269381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:09,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:09,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:09,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891049925] [2022-04-08 14:37:09,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:09,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 14:37:09,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:09,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:37:09,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:09,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:09,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:37:09,269 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:37:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:09,402 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 14:37:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:09,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 14:37:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:37:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:37:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:37:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:37:09,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 14:37:09,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:09,438 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:37:09,438 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:37:09,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:37:09,441 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:09,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:37:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-08 14:37:09,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:09,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:37:09,465 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:37:09,465 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:37:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:09,468 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:37:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:37:09,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:09,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:09,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 14:37:09,469 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 14:37:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:09,472 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:37:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:37:09,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:09,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:09,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:09,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:37:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-08 14:37:09,476 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-08 14:37:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:09,476 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-08 14:37:09,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:37:09,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-08 14:37:09,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-08 14:37:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:37:09,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:09,525 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:09,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:09,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:09,756 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-08 14:37:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:09,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318165038] [2022-04-08 14:37:09,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-08 14:37:09,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:09,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861420450] [2022-04-08 14:37:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:09,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:09,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:09,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [358921441] [2022-04-08 14:37:09,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:09,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:09,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:09,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:37:09,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:09,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:09,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:37:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:09,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:09,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-08 14:37:09,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {895#true} is VALID [2022-04-08 14:37:09,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:37:09,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-08 14:37:09,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-08 14:37:09,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,970 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {895#true} is VALID [2022-04-08 14:37:09,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-08 14:37:09,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-08 14:37:09,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:37:09,971 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,974 INFO L272 TraceCheckUtils]: 13: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {895#true} is VALID [2022-04-08 14:37:09,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-08 14:37:09,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-08 14:37:09,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:37:09,976 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:09,977 INFO L272 TraceCheckUtils]: 18: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:09,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:09,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-08 14:37:09,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-08 14:37:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:37:09,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:37:09,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:09,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861420450] [2022-04-08 14:37:09,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:09,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358921441] [2022-04-08 14:37:09,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358921441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:09,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:09,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:09,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:09,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318165038] [2022-04-08 14:37:09,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318165038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:09,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:09,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009008066] [2022-04-08 14:37:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:37:09,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:09,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:09,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:09,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:09,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:37:09,999 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:10,124 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 14:37:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:10,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:37:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:37:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:37:10,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 14:37:10,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:10,159 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:37:10,159 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:37:10,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:37:10,161 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:10,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:37:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:37:10,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:10,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:10,175 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:10,175 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:10,177 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 14:37:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:37:10,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:10,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:10,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-08 14:37:10,178 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-08 14:37:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:10,182 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 14:37:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:37:10,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:10,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:10,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:10,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-08 14:37:10,184 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-08 14:37:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:10,185 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-08 14:37:10,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:10,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-08 14:37:10,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:37:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:37:10,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:10,227 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:10,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:10,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:10,448 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-08 14:37:10,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:10,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [386783216] [2022-04-08 14:37:10,691 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:10,692 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 2 times [2022-04-08 14:37:10,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:10,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168559644] [2022-04-08 14:37:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:10,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:10,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366392545] [2022-04-08 14:37:10,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:10,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:10,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:10,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:10,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:37:10,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:10,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:10,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:37:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:10,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:10,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-08 14:37:10,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:37:10,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(<= ~counter~0 0)} assume true; {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:37:10,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(<= ~counter~0 0)} {1211#true} #66#return; {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:37:10,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(<= ~counter~0 0)} call #t~ret6 := main(); {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:37:10,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#(<= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1219#(<= ~counter~0 0)} is VALID [2022-04-08 14:37:10,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,856 INFO L272 TraceCheckUtils]: 8: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,857 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #54#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,858 INFO L272 TraceCheckUtils]: 13: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,859 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #56#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,860 INFO L272 TraceCheckUtils]: 18: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,863 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #58#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {1235#(<= ~counter~0 1)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1235#(<= ~counter~0 1)} is VALID [2022-04-08 14:37:10,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1290#(<= |main_#t~post5| 1)} is VALID [2022-04-08 14:37:10,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {1290#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1212#false} is VALID [2022-04-08 14:37:10,864 INFO L272 TraceCheckUtils]: 26: Hoare triple {1212#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1212#false} is VALID [2022-04-08 14:37:10,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2022-04-08 14:37:10,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2022-04-08 14:37:10,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-08 14:37:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:37:10,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:11,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-08 14:37:11,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2022-04-08 14:37:11,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2022-04-08 14:37:11,035 INFO L272 TraceCheckUtils]: 26: Hoare triple {1212#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1212#false} is VALID [2022-04-08 14:37:11,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {1318#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1212#false} is VALID [2022-04-08 14:37:11,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {1322#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1318#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:37:11,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {1322#(< ~counter~0 20)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1322#(< ~counter~0 20)} is VALID [2022-04-08 14:37:11,038 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1211#true} {1322#(< ~counter~0 20)} #58#return; {1322#(< ~counter~0 20)} is VALID [2022-04-08 14:37:11,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:37:11,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:37:11,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:37:11,038 INFO L272 TraceCheckUtils]: 18: Hoare triple {1322#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1211#true} is VALID [2022-04-08 14:37:11,039 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1211#true} {1322#(< ~counter~0 20)} #56#return; {1322#(< ~counter~0 20)} is VALID [2022-04-08 14:37:11,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:37:11,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:37:11,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:37:11,039 INFO L272 TraceCheckUtils]: 13: Hoare triple {1322#(< ~counter~0 20)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1211#true} is VALID [2022-04-08 14:37:11,040 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1322#(< ~counter~0 20)} #54#return; {1322#(< ~counter~0 20)} is VALID [2022-04-08 14:37:11,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:37:11,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:37:11,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:37:11,040 INFO L272 TraceCheckUtils]: 8: Hoare triple {1322#(< ~counter~0 20)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1211#true} is VALID [2022-04-08 14:37:11,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {1322#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1322#(< ~counter~0 20)} is VALID [2022-04-08 14:37:11,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {1377#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1322#(< ~counter~0 20)} is VALID [2022-04-08 14:37:11,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {1377#(< ~counter~0 19)} 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 19)} is VALID [2022-04-08 14:37:11,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#(< ~counter~0 19)} call #t~ret6 := main(); {1377#(< ~counter~0 19)} is VALID [2022-04-08 14:37:11,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1377#(< ~counter~0 19)} {1211#true} #66#return; {1377#(< ~counter~0 19)} is VALID [2022-04-08 14:37:11,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {1377#(< ~counter~0 19)} assume true; {1377#(< ~counter~0 19)} is VALID [2022-04-08 14:37:11,064 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 19)} is VALID [2022-04-08 14:37:11,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-08 14:37:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:37:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:11,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168559644] [2022-04-08 14:37:11,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:11,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366392545] [2022-04-08 14:37:11,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366392545] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:37:11,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:37:11,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:37:11,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [386783216] [2022-04-08 14:37:11,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [386783216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:11,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:11,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751457195] [2022-04-08 14:37:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 14:37:11,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:11,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:11,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:11,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:11,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:11,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:37:11,082 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:11,172 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-08 14:37:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:37:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 14:37:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-08 14:37:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-08 14:37:11,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-04-08 14:37:11,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:11,210 INFO L225 Difference]: With dead ends: 50 [2022-04-08 14:37:11,210 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 14:37:11,210 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 14:37:11,210 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:11,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 14:37:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 14:37:11,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:11,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:11,235 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:11,235 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:11,236 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-08 14:37:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-08 14:37:11,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:11,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:11,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 41 states. [2022-04-08 14:37:11,237 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 41 states. [2022-04-08 14:37:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:11,238 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-08 14:37:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-08 14:37:11,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:11,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:11,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:11,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-04-08 14:37:11,240 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-04-08 14:37:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:11,240 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-04-08 14:37:11,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:11,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 47 transitions. [2022-04-08 14:37:11,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-08 14:37:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:37:11,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:11,277 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:11,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:11,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:11,478 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:11,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 1 times [2022-04-08 14:37:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:11,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [419161517] [2022-04-08 14:37:11,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:11,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 2 times [2022-04-08 14:37:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:11,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775451514] [2022-04-08 14:37:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:11,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:11,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37019014] [2022-04-08 14:37:11,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:11,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:11,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:11,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:37:11,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:11,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:11,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:37:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:11,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:11,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-08 14:37:11,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1664#true} is VALID [2022-04-08 14:37:11,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:37:11,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #66#return; {1664#true} is VALID [2022-04-08 14:37:11,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret6 := main(); {1664#true} is VALID [2022-04-08 14:37:11,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:11,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:11,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:11,845 INFO L272 TraceCheckUtils]: 8: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1664#true} is VALID [2022-04-08 14:37:11,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:37:11,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:37:11,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:37:11,846 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1664#true} {1684#(and (= main_~a~0 0) (= main_~t~0 1))} #54#return; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:11,846 INFO L272 TraceCheckUtils]: 13: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1664#true} is VALID [2022-04-08 14:37:11,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:37:11,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:37:11,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:37:11,846 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1664#true} {1684#(and (= main_~a~0 0) (= main_~t~0 1))} #56#return; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:11,847 INFO L272 TraceCheckUtils]: 18: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1664#true} is VALID [2022-04-08 14:37:11,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:37:11,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:37:11,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:37:11,847 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1664#true} {1684#(and (= main_~a~0 0) (= main_~t~0 1))} #58#return; {1684#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:11,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {1684#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-08 14:37:11,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-08 14:37:11,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-08 14:37:11,849 INFO L272 TraceCheckUtils]: 26: Hoare triple {1739#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:11,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:11,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {1753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-08 14:37:11,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-08 14:37:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:37:11,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:11,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-08 14:37:11,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {1753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-08 14:37:11,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:11,958 INFO L272 TraceCheckUtils]: 26: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:11,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,960 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1664#true} {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #58#return; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:37:11,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:37:11,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:37:11,961 INFO L272 TraceCheckUtils]: 18: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1664#true} is VALID [2022-04-08 14:37:11,962 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1664#true} {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #56#return; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:37:11,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:37:11,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:37:11,962 INFO L272 TraceCheckUtils]: 13: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1664#true} is VALID [2022-04-08 14:37:11,963 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1664#true} {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #54#return; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:37:11,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {1664#true} assume !(0 == ~cond); {1664#true} is VALID [2022-04-08 14:37:11,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#true} ~cond := #in~cond; {1664#true} is VALID [2022-04-08 14:37:11,963 INFO L272 TraceCheckUtils]: 8: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1664#true} is VALID [2022-04-08 14:37:11,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1769#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:11,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret6 := main(); {1664#true} is VALID [2022-04-08 14:37:11,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #66#return; {1664#true} is VALID [2022-04-08 14:37:11,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 14:37:11,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1664#true} is VALID [2022-04-08 14:37:11,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-08 14:37:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 14:37:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775451514] [2022-04-08 14:37:11,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37019014] [2022-04-08 14:37:11,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37019014] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:37:11,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:37:11,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:37:11,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:11,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [419161517] [2022-04-08 14:37:11,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [419161517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:11,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:11,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552430886] [2022-04-08 14:37:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:11,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 14:37:11,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:11,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:11,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:11,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:11,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:37:11,984 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:12,103 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-08 14:37:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:12,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 14:37:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:37:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:37:12,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:37:12,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:12,128 INFO L225 Difference]: With dead ends: 47 [2022-04-08 14:37:12,128 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 14:37:12,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:37:12,128 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:12,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 14:37:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 14:37:12,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:12,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:12,172 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:12,172 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:12,173 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:37:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-08 14:37:12,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:12,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:12,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-04-08 14:37:12,174 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-04-08 14:37:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:12,175 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:37:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-08 14:37:12,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:12,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:12,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:12,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-08 14:37:12,177 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2022-04-08 14:37:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:12,177 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-08 14:37:12,177 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:12,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 50 transitions. [2022-04-08 14:37:12,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-08 14:37:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 14:37:12,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:12,214 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:12,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:12,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:12,414 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 3 times [2022-04-08 14:37:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:12,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126725049] [2022-04-08 14:37:12,569 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:12,569 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 4 times [2022-04-08 14:37:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:12,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172174153] [2022-04-08 14:37:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:12,583 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:12,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481024735] [2022-04-08 14:37:12,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:37:12,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:12,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:12,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:12,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 14:37:12,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:37:12,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:12,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:37:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:12,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:12,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #66#return; {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret6 := main(); {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} assume !!(#t~post5 < 20);havoc #t~post5; {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L272 TraceCheckUtils]: 8: Hoare triple {2126#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2126#true} is VALID [2022-04-08 14:37:12,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-08 14:37:12,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-08 14:37:12,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:37:12,821 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2126#true} {2126#true} #54#return; {2126#true} is VALID [2022-04-08 14:37:12,821 INFO L272 TraceCheckUtils]: 13: Hoare triple {2126#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2126#true} is VALID [2022-04-08 14:37:12,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {2126#true} ~cond := #in~cond; {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:12,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:12,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:12,823 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} {2126#true} #56#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:12,823 INFO L272 TraceCheckUtils]: 18: Hoare triple {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2126#true} is VALID [2022-04-08 14:37:12,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-08 14:37:12,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-08 14:37:12,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:37:12,824 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2126#true} {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:12,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:37:12,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:37:12,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:37:12,829 INFO L272 TraceCheckUtils]: 26: Hoare triple {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2126#true} is VALID [2022-04-08 14:37:12,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {2126#true} ~cond := #in~cond; {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:12,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {2173#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:12,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:12,831 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} {2203#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #54#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:12,831 INFO L272 TraceCheckUtils]: 31: Hoare triple {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:12,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:12,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {2232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-08 14:37:12,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-08 14:37:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:37:12,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:13,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-08 14:37:13,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {2232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-08 14:37:13,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:13,186 INFO L272 TraceCheckUtils]: 31: Hoare triple {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:13,187 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} {2251#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #54#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:13,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:13,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {2261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:13,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {2126#true} ~cond := #in~cond; {2261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:37:13,204 INFO L272 TraceCheckUtils]: 26: Hoare triple {2251#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2126#true} is VALID [2022-04-08 14:37:13,205 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 < 20);havoc #t~post5; {2251#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-08 14:37:13,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {2251#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2251#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-08 14:37:13,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2251#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-08 14:37:13,210 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2126#true} {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:13,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:37:13,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-08 14:37:13,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-08 14:37:13,210 INFO L272 TraceCheckUtils]: 18: Hoare triple {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2126#true} is VALID [2022-04-08 14:37:13,211 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} {2126#true} #56#return; {2184#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:13,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:13,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {2261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:13,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {2126#true} ~cond := #in~cond; {2261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:37:13,213 INFO L272 TraceCheckUtils]: 13: Hoare triple {2126#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2126#true} is VALID [2022-04-08 14:37:13,213 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2126#true} {2126#true} #54#return; {2126#true} is VALID [2022-04-08 14:37:13,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:37:13,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2022-04-08 14:37:13,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2022-04-08 14:37:13,213 INFO L272 TraceCheckUtils]: 8: Hoare triple {2126#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2126#true} is VALID [2022-04-08 14:37:13,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} assume !!(#t~post5 < 20);havoc #t~post5; {2126#true} is VALID [2022-04-08 14:37:13,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2126#true} is VALID [2022-04-08 14:37:13,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2126#true} is VALID [2022-04-08 14:37:13,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret6 := main(); {2126#true} is VALID [2022-04-08 14:37:13,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #66#return; {2126#true} is VALID [2022-04-08 14:37:13,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-08 14:37:13,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2126#true} is VALID [2022-04-08 14:37:13,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-08 14:37:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:37:13,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:13,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172174153] [2022-04-08 14:37:13,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:13,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481024735] [2022-04-08 14:37:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481024735] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:37:13,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:37:13,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 14:37:13,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:13,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126725049] [2022-04-08 14:37:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126725049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:13,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:13,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:37:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916794092] [2022-04-08 14:37:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:13,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-08 14:37:13,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:13,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:37:13,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:13,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:37:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:37:13,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:37:13,239 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:37:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:13,668 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:37:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:13,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-08 14:37:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:37:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-08 14:37:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:37:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-08 14:37:13,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-08 14:37:13,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:13,696 INFO L225 Difference]: With dead ends: 45 [2022-04-08 14:37:13,696 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:37:13,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:37:13,697 INFO L913 BasicCegarLoop]: 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-08 14:37:13,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:37:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:37:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:37:13,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:13,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:37:13,698 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:37:13,698 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:37:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:13,699 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:37:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:37:13,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:13,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:13,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:37:13,699 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:37:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:13,699 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:37:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:37:13,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:13,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:13,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:13,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:37:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:37:13,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-08 14:37:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:13,700 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:37:13,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:37:13,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:37:13,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:37:13,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:13,702 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:37:13,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:13,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:13,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:37:14,324 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 14:37:14,324 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 14:37:14,324 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 14:37:14,324 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:37:14,324 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-08 14:37:14,324 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:37:14,324 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 21 49) the Hoare annotation is: true [2022-04-08 14:37:14,325 INFO L885 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-08 14:37:14,325 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 21 49) the Hoare annotation is: true [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L30-1(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:37:14,325 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 14:37:14,326 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:37:14,326 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:37:14,326 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:37:14,326 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:37:14,326 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:37:14,326 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 14:37:14,326 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:37:14,326 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:37:14,326 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:37:14,326 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:37:14,326 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:37:14,328 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2] [2022-04-08 14:37:14,329 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:37:14,331 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:37:14,332 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 14:37:14,333 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:37:14,333 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 14:37:14,333 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 14:37:14,336 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-08 14:37:14,343 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:37:14,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:37:14 BoogieIcfgContainer [2022-04-08 14:37:14,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:37:14,351 INFO L158 Benchmark]: Toolchain (without parser) took 7372.58ms. Allocated memory was 184.5MB in the beginning and 383.8MB in the end (delta: 199.2MB). Free memory was 127.6MB in the beginning and 271.9MB in the end (delta: -144.2MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-04-08 14:37:14,351 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:37:14,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.03ms. Allocated memory was 184.5MB in the beginning and 319.8MB in the end (delta: 135.3MB). Free memory was 127.4MB in the beginning and 290.4MB in the end (delta: -162.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:37:14,351 INFO L158 Benchmark]: Boogie Preprocessor took 27.16ms. Allocated memory is still 319.8MB. Free memory was 290.4MB in the beginning and 289.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 14:37:14,352 INFO L158 Benchmark]: RCFGBuilder took 253.88ms. Allocated memory is still 319.8MB. Free memory was 289.3MB in the beginning and 277.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 14:37:14,352 INFO L158 Benchmark]: TraceAbstraction took 6854.61ms. Allocated memory was 319.8MB in the beginning and 383.8MB in the end (delta: 64.0MB). Free memory was 276.7MB in the beginning and 271.9MB in the end (delta: 4.9MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2022-04-08 14:37:14,353 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 184.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.03ms. Allocated memory was 184.5MB in the beginning and 319.8MB in the end (delta: 135.3MB). Free memory was 127.4MB in the beginning and 290.4MB in the end (delta: -162.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.16ms. Allocated memory is still 319.8MB. Free memory was 290.4MB in the beginning and 289.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 253.88ms. Allocated memory is still 319.8MB. Free memory was 289.3MB in the beginning and 277.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6854.61ms. Allocated memory was 319.8MB in the beginning and 383.8MB in the end (delta: 64.0MB). Free memory was 276.7MB in the beginning and 271.9MB in the end (delta: 4.9MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 525 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 333 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 209 mSDtfsCounter, 333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 164 PreInvPairs, 227 NumberOfFragments, 278 HoareAnnotationTreeSize, 164 FomulaSimplifications, 129 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 816 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (s == t + a * a && t == a * 2 + 1) || !(\old(counter) == 0) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-08 14:37:14,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...