/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/loops-crafted-1/nested_delay_nd.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:05:42,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:05:42,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:05:42,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:05:42,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:05:42,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:05:42,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:05:42,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:05:42,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:05:42,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:05:42,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:05:42,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:05:42,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:05:42,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:05:42,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:05:42,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:05:42,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:05:42,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:05:42,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:05:42,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:05:42,730 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:05:42,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:05:42,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:05:42,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:05:42,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:05:42,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:05:42,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:05:42,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:05:42,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:05:42,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:05:42,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:05:42,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:05:42,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:05:42,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:05:42,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:05:42,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:05:42,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:05:42,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:05:42,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:05:42,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:05:42,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:05:42,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:05:42,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:05:42,770 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:05:42,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:05:42,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:05:42,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:05:42,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:05:42,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:05:42,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:05:42,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:05:42,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:05:42,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:05:42,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:05:42,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:05:42,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:05:42,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:05:42,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:05:42,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:05:42,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:05:42,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:05:42,775 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:05:42,775 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:05:42,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:05:42,776 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:05:42,776 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-15 13:05:43,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:05:43,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:05:43,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:05:43,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:05:43,052 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:05:43,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_nd.c [2022-04-15 13:05:43,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f793b404/ac3e0a787fc14c89b3c4121a5927d5e9/FLAGe7b74e570 [2022-04-15 13:05:43,536 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:05:43,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_nd.c [2022-04-15 13:05:43,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f793b404/ac3e0a787fc14c89b3c4121a5927d5e9/FLAGe7b74e570 [2022-04-15 13:05:43,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f793b404/ac3e0a787fc14c89b3c4121a5927d5e9 [2022-04-15 13:05:43,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:05:43,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:05:43,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:05:43,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:05:43,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:05:43,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:05:43" (1/1) ... [2022-04-15 13:05:43,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2d997d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:43, skipping insertion in model container [2022-04-15 13:05:43,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:05:43" (1/1) ... [2022-04-15 13:05:43,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:05:43,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:05:44,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/loops-crafted-1/nested_delay_nd.c[465,478] [2022-04-15 13:05:44,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:05:44,159 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:05:44,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_nd.c[465,478] [2022-04-15 13:05:44,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:05:44,189 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:05:44,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44 WrapperNode [2022-04-15 13:05:44,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:05:44,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:05:44,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:05:44,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:05:44,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (1/1) ... [2022-04-15 13:05:44,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (1/1) ... [2022-04-15 13:05:44,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (1/1) ... [2022-04-15 13:05:44,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (1/1) ... [2022-04-15 13:05:44,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (1/1) ... [2022-04-15 13:05:44,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (1/1) ... [2022-04-15 13:05:44,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (1/1) ... [2022-04-15 13:05:44,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:05:44,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:05:44,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:05:44,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:05:44,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (1/1) ... [2022-04-15 13:05:44,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:05:44,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:44,246 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-15 13:05:44,248 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-15 13:05:44,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:05:44,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:05:44,278 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:05:44,278 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:05:44,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:05:44,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:05:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:05:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:05:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:05:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:05:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:05:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:05:44,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:05:44,280 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:05:44,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:05:44,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:05:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:05:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:05:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:05:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:05:44,350 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:05:44,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:05:44,493 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:05:44,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:05:44,500 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:05:44,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:44 BoogieIcfgContainer [2022-04-15 13:05:44,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:05:44,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:05:44,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:05:44,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:05:44,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:05:43" (1/3) ... [2022-04-15 13:05:44,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abe3c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:44, skipping insertion in model container [2022-04-15 13:05:44,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:44" (2/3) ... [2022-04-15 13:05:44,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abe3c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:44, skipping insertion in model container [2022-04-15 13:05:44,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:44" (3/3) ... [2022-04-15 13:05:44,529 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_nd.c [2022-04-15 13:05:44,534 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:05:44,535 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:05:44,607 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:05:44,613 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-15 13:05:44,614 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:05:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:05:44,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:44,641 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:44,641 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:44,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 1 times [2022-04-15 13:05:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:44,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853895437] [2022-04-15 13:05:44,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:05:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 2 times [2022-04-15 13:05:44,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:44,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713556828] [2022-04-15 13:05:44,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:44,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:44,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {35#true} is VALID [2022-04-15 13:05:44,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 13:05:44,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #90#return; {35#true} is VALID [2022-04-15 13:05:44,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:44,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 13:05:44,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 13:05:44,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 13:05:44,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #86#return; {36#false} is VALID [2022-04-15 13:05:44,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:44,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {35#true} is VALID [2022-04-15 13:05:44,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 13:05:44,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #90#return; {35#true} is VALID [2022-04-15 13:05:44,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-15 13:05:44,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-15 13:05:44,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {35#true} is VALID [2022-04-15 13:05:44,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 13:05:44,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 13:05:44,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 13:05:44,927 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #86#return; {36#false} is VALID [2022-04-15 13:05:44,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {36#false} is VALID [2022-04-15 13:05:44,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !false;~st~0 := 1;~c~0 := 0; {36#false} is VALID [2022-04-15 13:05:44,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-15 13:05:44,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {36#false} is VALID [2022-04-15 13:05:44,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {36#false} is VALID [2022-04-15 13:05:44,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {36#false} is VALID [2022-04-15 13:05:44,929 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {36#false} is VALID [2022-04-15 13:05:44,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-15 13:05:44,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-15 13:05:44,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 13:05:44,931 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-15 13:05:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:44,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713556828] [2022-04-15 13:05:44,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713556828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:44,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:44,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:05:44,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:44,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853895437] [2022-04-15 13:05:44,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853895437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:44,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:44,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:05:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977795688] [2022-04-15 13:05:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:44,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 13:05:44,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:44,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:44,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:44,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:05:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:05:45,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:05:45,024 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:45,213 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-15 13:05:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:05:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 13:05:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 13:05:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 13:05:45,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-15 13:05:45,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:45,317 INFO L225 Difference]: With dead ends: 50 [2022-04-15 13:05:45,317 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:05:45,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-15 13:05:45,324 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:45,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:05:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:05:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 13:05:45,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:45,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:45,392 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:45,393 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:45,396 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 13:05:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:05:45,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:45,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:45,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 13:05:45,398 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 13:05:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:45,401 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 13:05:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:05:45,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:45,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:45,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:45,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-15 13:05:45,413 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2022-04-15 13:05:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:45,414 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-15 13:05:45,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:45,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-15 13:05:45,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:05:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:05:45,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:45,454 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:45,454 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:05:45,454 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 1 times [2022-04-15 13:05:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1474004209] [2022-04-15 13:05:45,459 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:05:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 2 times [2022-04-15 13:05:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:45,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113798358] [2022-04-15 13:05:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:45,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:45,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#(<= 200000 ~SIZE~0)} assume true; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#(<= 200000 ~SIZE~0)} {255#true} #90#return; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:45,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} ~cond := #in~cond; {255#true} is VALID [2022-04-15 13:05:45,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#true} assume !(0 == ~cond); {255#true} is VALID [2022-04-15 13:05:45,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-15 13:05:45,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {255#true} {260#(<= 200000 ~SIZE~0)} #86#return; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:45,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#(<= 200000 ~SIZE~0)} assume true; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#(<= 200000 ~SIZE~0)} {255#true} #90#return; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#(<= 200000 ~SIZE~0)} call #t~ret7 := main(); {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#(<= 200000 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {260#(<= 200000 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {255#true} is VALID [2022-04-15 13:05:45,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#true} ~cond := #in~cond; {255#true} is VALID [2022-04-15 13:05:45,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#true} assume !(0 == ~cond); {255#true} is VALID [2022-04-15 13:05:45,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-15 13:05:45,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {255#true} {260#(<= 200000 ~SIZE~0)} #86#return; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#(<= 200000 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {260#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:45,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {260#(<= 200000 ~SIZE~0)} assume !false;~st~0 := 1;~c~0 := 0; {265#(and (= main_~c~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:45,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(and (= main_~c~0 0) (<= 200000 ~SIZE~0))} assume !(~c~0 < ~SIZE~0); {256#false} is VALID [2022-04-15 13:05:45,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {256#false} is VALID [2022-04-15 13:05:45,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {256#false} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {256#false} is VALID [2022-04-15 13:05:45,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {256#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {256#false} is VALID [2022-04-15 13:05:45,598 INFO L272 TraceCheckUtils]: 17: Hoare triple {256#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {256#false} is VALID [2022-04-15 13:05:45,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2022-04-15 13:05:45,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2022-04-15 13:05:45,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {256#false} assume !false; {256#false} is VALID [2022-04-15 13:05:45,599 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-15 13:05:45,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:45,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113798358] [2022-04-15 13:05:45,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113798358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:45,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:45,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:05:45,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:45,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1474004209] [2022-04-15 13:05:45,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1474004209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:45,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:45,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:05:45,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741869551] [2022-04-15 13:05:45,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 13:05:45,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:45,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:45,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:45,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:05:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:05:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:05:45,622 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:45,821 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-15 13:05:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:05:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 13:05:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-15 13:05:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-15 13:05:45,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-15 13:05:45,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:45,894 INFO L225 Difference]: With dead ends: 46 [2022-04-15 13:05:45,894 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:05:45,895 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:05:45,896 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:45,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:05:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:05:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-15 13:05:45,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:45,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:45,929 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:45,929 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:45,931 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 13:05:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 13:05:45,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:45,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:45,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 13:05:45,933 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 13:05:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:45,935 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 13:05:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 13:05:45,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:45,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:45,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:45,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-15 13:05:45,938 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2022-04-15 13:05:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:45,938 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-15 13:05:45,938 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:45,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-15 13:05:45,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 13:05:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:05:45,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:45,974 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:45,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:05:45,975 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:45,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash -673447056, now seen corresponding path program 1 times [2022-04-15 13:05:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:45,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [124252868] [2022-04-15 13:05:46,170 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash 315662187, now seen corresponding path program 1 times [2022-04-15 13:05:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:46,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060078878] [2022-04-15 13:05:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:46,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {482#true} is VALID [2022-04-15 13:05:46,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-15 13:05:46,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {482#true} {482#true} #90#return; {482#true} is VALID [2022-04-15 13:05:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:46,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {482#true} ~cond := #in~cond; {482#true} is VALID [2022-04-15 13:05:46,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} assume !(0 == ~cond); {482#true} is VALID [2022-04-15 13:05:46,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-15 13:05:46,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #86#return; {482#true} is VALID [2022-04-15 13:05:46,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {492#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:46,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {482#true} is VALID [2022-04-15 13:05:46,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-15 13:05:46,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #90#return; {482#true} is VALID [2022-04-15 13:05:46,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} call #t~ret7 := main(); {482#true} is VALID [2022-04-15 13:05:46,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {482#true} is VALID [2022-04-15 13:05:46,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {482#true} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {482#true} is VALID [2022-04-15 13:05:46,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {482#true} ~cond := #in~cond; {482#true} is VALID [2022-04-15 13:05:46,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#true} assume !(0 == ~cond); {482#true} is VALID [2022-04-15 13:05:46,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-15 13:05:46,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {482#true} {482#true} #86#return; {482#true} is VALID [2022-04-15 13:05:46,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {482#true} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {482#true} is VALID [2022-04-15 13:05:46,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#true} assume !false;~st~0 := 1;~c~0 := 0; {482#true} is VALID [2022-04-15 13:05:46,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#true} [94] L27-3-->L27-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_In_1 v_main_~c~0_Out_2))) (or (and (= v_main_~c~0_Out_2 0) (<= (+ v_~last~0_In_1 1) v_main_~c~0_Out_2) (= |v_main_#t~post5_Out_2| 0) (< v_main_~c~0_Out_2 (+ v_~SIZE~0_In_1 1)) (= v_main_~st~0_Out_2 0) .cse0 (= v_~last~0_In_1 0)) (and (= v_~last~0_In_1 v_~last~0_In_1) (= v_~SIZE~0_In_1 v_~SIZE~0_In_1) .cse0))) InVars {~SIZE~0=v_~SIZE~0_In_1, main_~c~0=v_main_~c~0_In_1, ~last~0=v_~last~0_In_1} OutVars{~SIZE~0=v_~SIZE~0_In_1, main_#t~post5=|v_main_#t~post5_Out_2|, main_~c~0=v_main_~c~0_Out_2, main_~st~0=v_main_~st~0_Out_2, ~last~0=v_~last~0_In_1} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {482#true} is VALID [2022-04-15 13:05:46,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#true} [93] L27-4_primed-->L27-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 13:05:46,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#true} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {491#(<= (+ ~last~0 1) main_~c~0)} is VALID [2022-04-15 13:05:46,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {491#(<= (+ ~last~0 1) main_~c~0)} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {483#false} is VALID [2022-04-15 13:05:46,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {483#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {483#false} is VALID [2022-04-15 13:05:46,237 INFO L272 TraceCheckUtils]: 18: Hoare triple {483#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {483#false} is VALID [2022-04-15 13:05:46,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#false} ~cond := #in~cond; {483#false} is VALID [2022-04-15 13:05:46,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {483#false} assume 0 == ~cond; {483#false} is VALID [2022-04-15 13:05:46,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {483#false} assume !false; {483#false} is VALID [2022-04-15 13:05:46,238 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-15 13:05:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:46,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060078878] [2022-04-15 13:05:46,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060078878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:46,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:46,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:05:46,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:46,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [124252868] [2022-04-15 13:05:46,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [124252868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:46,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:46,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:05:46,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010565439] [2022-04-15 13:05:46,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:46,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 13:05:46,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:46,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:46,321 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-15 13:05:46,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:05:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:05:46,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:05:46,323 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:46,728 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2022-04-15 13:05:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:05:46,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 13:05:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-15 13:05:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-15 13:05:46,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-15 13:05:46,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:46,815 INFO L225 Difference]: With dead ends: 59 [2022-04-15 13:05:46,815 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 13:05:46,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:05:46,817 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:46,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 45 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:05:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 13:05:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-04-15 13:05:46,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:46,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:46,855 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:46,856 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:46,859 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-15 13:05:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-15 13:05:46,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:46,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:46,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 13:05:46,860 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 13:05:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:46,862 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-15 13:05:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-15 13:05:46,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:46,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:46,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:46,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-04-15 13:05:46,865 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 24 [2022-04-15 13:05:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:46,866 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-04-15 13:05:46,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:46,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 43 transitions. [2022-04-15 13:05:46,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-15 13:05:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:05:46,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:46,905 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:46,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:05:46,906 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:46,906 INFO L85 PathProgramCache]: Analyzing trace with hash 708533296, now seen corresponding path program 1 times [2022-04-15 13:05:46,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:46,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64404178] [2022-04-15 13:05:47,000 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1961381293, now seen corresponding path program 1 times [2022-04-15 13:05:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:47,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841535009] [2022-04-15 13:05:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:47,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:47,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:47,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {774#true} is VALID [2022-04-15 13:05:47,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 13:05:47,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #90#return; {774#true} is VALID [2022-04-15 13:05:47,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:47,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 13:05:47,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 13:05:47,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 13:05:47,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #86#return; {774#true} is VALID [2022-04-15 13:05:47,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {784#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:47,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {774#true} is VALID [2022-04-15 13:05:47,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 13:05:47,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #90#return; {774#true} is VALID [2022-04-15 13:05:47,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret7 := main(); {774#true} is VALID [2022-04-15 13:05:47,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {774#true} is VALID [2022-04-15 13:05:47,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {774#true} is VALID [2022-04-15 13:05:47,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 13:05:47,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 13:05:47,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 13:05:47,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #86#return; {774#true} is VALID [2022-04-15 13:05:47,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {774#true} is VALID [2022-04-15 13:05:47,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#true} assume !false;~st~0 := 1;~c~0 := 0; {783#(= main_~st~0 1)} is VALID [2022-04-15 13:05:47,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#(= main_~st~0 1)} [96] L27-3-->L27-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_In_2 v_main_~c~0_Out_4))) (or (and (= v_~SIZE~0_In_2 v_~SIZE~0_In_2) (= v_~last~0_In_2 v_~last~0_In_2) .cse0) (and (= |v_main_#t~post5_Out_4| 0) .cse0 (< v_main_~c~0_Out_4 (+ v_~SIZE~0_In_2 1)) (< v_main_~c~0_Out_4 (+ v_~last~0_In_2 1)) (= v_main_~c~0_Out_4 0) (= v_~last~0_In_2 0)))) InVars {~SIZE~0=v_~SIZE~0_In_2, main_~c~0=v_main_~c~0_In_2, ~last~0=v_~last~0_In_2} OutVars{~SIZE~0=v_~SIZE~0_In_2, main_#t~post5=|v_main_#t~post5_Out_4|, main_~c~0=v_main_~c~0_Out_4, ~last~0=v_~last~0_In_2} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {783#(= main_~st~0 1)} is VALID [2022-04-15 13:05:47,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(= main_~st~0 1)} [95] L27-4_primed-->L27-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {783#(= main_~st~0 1)} is VALID [2022-04-15 13:05:47,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#(= main_~st~0 1)} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {783#(= main_~st~0 1)} is VALID [2022-04-15 13:05:47,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {783#(= main_~st~0 1)} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {775#false} is VALID [2022-04-15 13:05:47,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {775#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {775#false} is VALID [2022-04-15 13:05:47,062 INFO L272 TraceCheckUtils]: 18: Hoare triple {775#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {775#false} is VALID [2022-04-15 13:05:47,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-15 13:05:47,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-15 13:05:47,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-15 13:05:47,063 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-15 13:05:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841535009] [2022-04-15 13:05:47,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841535009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:47,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:47,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:05:47,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:47,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [64404178] [2022-04-15 13:05:47,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [64404178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:47,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:47,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:05:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472784180] [2022-04-15 13:05:47,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:47,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 13:05:47,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:47,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:47,143 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-15 13:05:47,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:05:47,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:47,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:05:47,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:05:47,145 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:47,530 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-04-15 13:05:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:05:47,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 13:05:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-15 13:05:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-15 13:05:47,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-15 13:05:47,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:47,609 INFO L225 Difference]: With dead ends: 64 [2022-04-15 13:05:47,609 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 13:05:47,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:05:47,610 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:47,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 55 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:05:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 13:05:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-15 13:05:47,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:47,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:47,651 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:47,651 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:47,653 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 13:05:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-15 13:05:47,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:47,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:47,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 13:05:47,655 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 13:05:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:47,657 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 13:05:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-15 13:05:47,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:47,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:47,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:47,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-15 13:05:47,659 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 24 [2022-04-15 13:05:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:47,659 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-15 13:05:47,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:05:47,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-15 13:05:47,698 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-15 13:05:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-15 13:05:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:05:47,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:47,699 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:47,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 13:05:47,699 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2061972965, now seen corresponding path program 1 times [2022-04-15 13:05:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:47,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929749274] [2022-04-15 13:05:47,820 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:47,822 INFO L85 PathProgramCache]: Analyzing trace with hash -890294784, now seen corresponding path program 1 times [2022-04-15 13:05:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:47,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879027390] [2022-04-15 13:05:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:47,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:47,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {1082#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:47,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1082#(<= 200000 ~SIZE~0)} assume true; {1082#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:47,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1082#(<= 200000 ~SIZE~0)} {1070#true} #90#return; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:05:47,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:47,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {1070#true} ~cond := #in~cond; {1070#true} is VALID [2022-04-15 13:05:47,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} assume !(0 == ~cond); {1070#true} is VALID [2022-04-15 13:05:47,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-15 13:05:47,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1075#(not (= ~SIZE~0 0))} #86#return; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:05:47,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1081#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:47,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {1082#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:47,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {1082#(<= 200000 ~SIZE~0)} assume true; {1082#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:47,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1082#(<= 200000 ~SIZE~0)} {1070#true} #90#return; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:05:47,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {1075#(not (= ~SIZE~0 0))} call #t~ret7 := main(); {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:05:47,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {1075#(not (= ~SIZE~0 0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:05:47,911 INFO L272 TraceCheckUtils]: 6: Hoare triple {1075#(not (= ~SIZE~0 0))} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {1070#true} is VALID [2022-04-15 13:05:47,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {1070#true} ~cond := #in~cond; {1070#true} is VALID [2022-04-15 13:05:47,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1070#true} assume !(0 == ~cond); {1070#true} is VALID [2022-04-15 13:05:47,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-15 13:05:47,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1070#true} {1075#(not (= ~SIZE~0 0))} #86#return; {1075#(not (= ~SIZE~0 0))} is VALID [2022-04-15 13:05:47,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {1075#(not (= ~SIZE~0 0))} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:05:47,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume !false;~st~0 := 1;~c~0 := 0; {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:05:47,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} [98] L27-3-->L27-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_In_3 v_main_~c~0_Out_6))) (or (and .cse0 (= v_~SIZE~0_In_3 v_~SIZE~0_In_3) (= v_~last~0_In_3 v_~last~0_In_3)) (and (< v_main_~c~0_Out_6 (+ v_~SIZE~0_In_3 1)) .cse0 (= v_main_~c~0_Out_6 0) (<= (+ v_~last~0_In_3 1) v_main_~c~0_Out_6) (= |v_main_#t~post5_Out_6| 0) (= v_main_~st~0_Out_4 0) (= v_~last~0_In_3 0)))) InVars {~SIZE~0=v_~SIZE~0_In_3, main_~c~0=v_main_~c~0_In_3, ~last~0=v_~last~0_In_3} OutVars{~SIZE~0=v_~SIZE~0_In_3, main_#t~post5=|v_main_#t~post5_Out_6|, main_~c~0=v_main_~c~0_Out_6, main_~st~0=v_main_~st~0_Out_4, ~last~0=v_~last~0_In_3} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:05:47,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} [97] L27-4_primed-->L27-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:05:47,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:05:47,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:05:47,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume !(1 == ~st~0 && ~last~0 < ~SIZE~0); {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} is VALID [2022-04-15 13:05:47,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {1080#(and (= main_~d~0 0) (not (= ~SIZE~0 0)))} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {1071#false} is VALID [2022-04-15 13:05:47,916 INFO L272 TraceCheckUtils]: 19: Hoare triple {1071#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {1071#false} is VALID [2022-04-15 13:05:47,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {1071#false} ~cond := #in~cond; {1071#false} is VALID [2022-04-15 13:05:47,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {1071#false} assume 0 == ~cond; {1071#false} is VALID [2022-04-15 13:05:47,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-15 13:05:47,917 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-15 13:05:47,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:47,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879027390] [2022-04-15 13:05:47,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879027390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:47,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:47,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:05:48,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:48,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929749274] [2022-04-15 13:05:48,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929749274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:48,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:48,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:05:48,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4868125] [2022-04-15 13:05:48,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:48,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:05:48,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:48,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:48,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:48,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:05:48,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:48,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:05:48,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:05:48,026 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:48,529 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2022-04-15 13:05:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:05:48,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:05:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-15 13:05:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-15 13:05:48,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2022-04-15 13:05:48,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:48,608 INFO L225 Difference]: With dead ends: 77 [2022-04-15 13:05:48,608 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 13:05:48,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:05:48,609 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 111 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:48,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 29 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:05:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 13:05:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-04-15 13:05:48,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:48,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:48,687 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:48,688 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:48,690 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-15 13:05:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-15 13:05:48,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:48,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:48,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 55 states. [2022-04-15 13:05:48,693 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 55 states. [2022-04-15 13:05:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:48,695 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-15 13:05:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-15 13:05:48,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:48,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:48,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:48,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-15 13:05:48,699 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 25 [2022-04-15 13:05:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:48,699 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-15 13:05:48,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:48,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-15 13:05:48,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:05:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:05:48,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:48,773 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:48,773 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 13:05:48,774 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:48,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2060125923, now seen corresponding path program 1 times [2022-04-15 13:05:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:48,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414870349] [2022-04-15 13:05:48,882 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -601416382, now seen corresponding path program 1 times [2022-04-15 13:05:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:48,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070791567] [2022-04-15 13:05:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:48,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:48,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {1478#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:48,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1470#(<= 200000 ~SIZE~0)} assume true; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:48,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1470#(<= 200000 ~SIZE~0)} {1465#true} #90#return; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:48,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#true} ~cond := #in~cond; {1465#true} is VALID [2022-04-15 13:05:48,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#true} assume !(0 == ~cond); {1465#true} is VALID [2022-04-15 13:05:48,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#true} assume true; {1465#true} is VALID [2022-04-15 13:05:48,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1470#(<= 200000 ~SIZE~0)} #86#return; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:48,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {1465#true} call ULTIMATE.init(); {1478#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:48,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {1478#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:48,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {1470#(<= 200000 ~SIZE~0)} assume true; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:48,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1470#(<= 200000 ~SIZE~0)} {1465#true} #90#return; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:48,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1470#(<= 200000 ~SIZE~0)} call #t~ret7 := main(); {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:48,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1470#(<= 200000 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,000 INFO L272 TraceCheckUtils]: 6: Hoare triple {1470#(<= 200000 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {1465#true} is VALID [2022-04-15 13:05:49,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#true} ~cond := #in~cond; {1465#true} is VALID [2022-04-15 13:05:49,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#true} assume !(0 == ~cond); {1465#true} is VALID [2022-04-15 13:05:49,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#true} assume true; {1465#true} is VALID [2022-04-15 13:05:49,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1465#true} {1470#(<= 200000 ~SIZE~0)} #86#return; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1470#(<= 200000 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {1470#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {1470#(<= 200000 ~SIZE~0)} assume !false;~st~0 := 1;~c~0 := 0; {1475#(and (= main_~c~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:49,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {1475#(and (= main_~c~0 0) (<= 200000 ~SIZE~0))} [100] L27-3-->L27-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_In_4 v_main_~c~0_Out_8))) (or (and (= v_main_~c~0_Out_8 0) (= |v_main_#t~post5_Out_8| 0) (< v_main_~c~0_Out_8 (+ v_~SIZE~0_In_4 1)) .cse0 (<= (+ v_~last~0_In_4 1) v_main_~c~0_Out_8) (= v_main_~st~0_Out_6 0) (= v_~last~0_In_4 0)) (and .cse0 (= v_~last~0_In_4 v_~last~0_In_4) (= v_~SIZE~0_In_4 v_~SIZE~0_In_4)))) InVars {~SIZE~0=v_~SIZE~0_In_4, main_~c~0=v_main_~c~0_In_4, ~last~0=v_~last~0_In_4} OutVars{~SIZE~0=v_~SIZE~0_In_4, main_#t~post5=|v_main_#t~post5_Out_8|, main_~c~0=v_main_~c~0_Out_8, main_~st~0=v_main_~st~0_Out_6, ~last~0=v_~last~0_In_4} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1476#(and (or (<= ~last~0 0) (= main_~c~0 0)) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:49,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {1476#(and (or (<= ~last~0 0) (= main_~c~0 0)) (<= 200000 ~SIZE~0))} [99] L27-4_primed-->L27-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {1477#(and (<= ~last~0 0) (<= 200000 main_~c~0))} is VALID [2022-04-15 13:05:49,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {1477#(and (<= ~last~0 0) (<= 200000 main_~c~0))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1466#false} is VALID [2022-04-15 13:05:49,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {1466#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1466#false} is VALID [2022-04-15 13:05:49,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {1466#false} assume !(1 == ~st~0 && ~last~0 < ~SIZE~0); {1466#false} is VALID [2022-04-15 13:05:49,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {1466#false} assume !(~d~0 == ~SIZE~0); {1466#false} is VALID [2022-04-15 13:05:49,005 INFO L272 TraceCheckUtils]: 19: Hoare triple {1466#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {1466#false} is VALID [2022-04-15 13:05:49,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {1466#false} ~cond := #in~cond; {1466#false} is VALID [2022-04-15 13:05:49,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#false} assume 0 == ~cond; {1466#false} is VALID [2022-04-15 13:05:49,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {1466#false} assume !false; {1466#false} is VALID [2022-04-15 13:05:49,006 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-15 13:05:49,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:49,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070791567] [2022-04-15 13:05:49,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070791567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:49,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:49,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:05:49,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:49,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414870349] [2022-04-15 13:05:49,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414870349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:49,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:49,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:05:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781210046] [2022-04-15 13:05:49,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:05:49,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:49,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:49,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:49,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:05:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:05:49,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:05:49,084 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:49,439 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2022-04-15 13:05:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:05:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:05:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 13:05:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 13:05:49,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 13:05:49,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:49,502 INFO L225 Difference]: With dead ends: 101 [2022-04-15 13:05:49,502 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 13:05:49,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:05:49,505 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:49,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:05:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 13:05:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-04-15 13:05:49,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:49,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:49,606 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:49,606 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:49,608 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-15 13:05:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-15 13:05:49,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:49,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:49,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 63 states. [2022-04-15 13:05:49,609 INFO L87 Difference]: Start difference. First operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 63 states. [2022-04-15 13:05:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:49,615 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-15 13:05:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-15 13:05:49,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:49,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:49,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:49,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:05:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 13:05:49,617 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 25 [2022-04-15 13:05:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:49,617 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-15 13:05:49,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:49,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-15 13:05:49,694 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-15 13:05:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 13:05:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:05:49,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:49,695 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:49,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 13:05:49,695 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2067453981, now seen corresponding path program 1 times [2022-04-15 13:05:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:49,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [768015437] [2022-04-15 13:05:49,766 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1182836992, now seen corresponding path program 1 times [2022-04-15 13:05:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:49,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324207301] [2022-04-15 13:05:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:49,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {1938#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {1931#(<= 200000 ~SIZE~0)} assume true; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1931#(<= 200000 ~SIZE~0)} {1926#true} #90#return; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:49,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {1926#true} ~cond := #in~cond; {1926#true} is VALID [2022-04-15 13:05:49,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {1926#true} assume !(0 == ~cond); {1926#true} is VALID [2022-04-15 13:05:49,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {1926#true} assume true; {1926#true} is VALID [2022-04-15 13:05:49,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1926#true} {1931#(<= 200000 ~SIZE~0)} #86#return; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {1926#true} call ULTIMATE.init(); {1938#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:49,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {1931#(<= 200000 ~SIZE~0)} assume true; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1931#(<= 200000 ~SIZE~0)} {1926#true} #90#return; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {1931#(<= 200000 ~SIZE~0)} call #t~ret7 := main(); {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1931#(<= 200000 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {1931#(<= 200000 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {1926#true} is VALID [2022-04-15 13:05:49,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {1926#true} ~cond := #in~cond; {1926#true} is VALID [2022-04-15 13:05:49,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {1926#true} assume !(0 == ~cond); {1926#true} is VALID [2022-04-15 13:05:49,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1926#true} assume true; {1926#true} is VALID [2022-04-15 13:05:49,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1926#true} {1931#(<= 200000 ~SIZE~0)} #86#return; {1931#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:49,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {1931#(<= 200000 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:49,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} assume !false;~st~0 := 1;~c~0 := 0; {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:49,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} [102] L27-3-->L27-4_primed: Formula: (or (and (= v_~SIZE~0_In_5 v_~SIZE~0_In_5) (= v_~last~0_In_5 v_~last~0_In_5) (= v_main_~c~0_In_5 v_main_~c~0_Out_10)) (and (< v_main_~c~0_Out_10 (+ v_~last~0_In_5 1)) (= v_main_~c~0_Out_10 v_main_~c~0_In_5) (= v_main_~c~0_Out_10 0) (< v_main_~c~0_Out_10 (+ v_~SIZE~0_In_5 1)) (= v_~last~0_In_5 0) (= |v_main_#t~post5_Out_10| 0))) InVars {~SIZE~0=v_~SIZE~0_In_5, main_~c~0=v_main_~c~0_In_5, ~last~0=v_~last~0_In_5} OutVars{~SIZE~0=v_~SIZE~0_In_5, main_#t~post5=|v_main_#t~post5_Out_10|, main_~c~0=v_main_~c~0_Out_10, ~last~0=v_~last~0_In_5} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:49,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} [101] L27-4_primed-->L27-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:49,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:49,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:49,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1936#(and (= main_~d~0 0) (<= 200000 ~SIZE~0))} assume 1 == ~st~0 && ~last~0 < ~SIZE~0;#t~post6 := ~d~0;~d~0 := 1 + #t~post6;havoc #t~post6; {1937#(<= (+ main_~d~0 199999) ~SIZE~0)} is VALID [2022-04-15 13:05:49,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {1937#(<= (+ main_~d~0 199999) ~SIZE~0)} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {1927#false} is VALID [2022-04-15 13:05:49,841 INFO L272 TraceCheckUtils]: 19: Hoare triple {1927#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {1927#false} is VALID [2022-04-15 13:05:49,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1927#false} ~cond := #in~cond; {1927#false} is VALID [2022-04-15 13:05:49,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {1927#false} assume 0 == ~cond; {1927#false} is VALID [2022-04-15 13:05:49,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {1927#false} assume !false; {1927#false} is VALID [2022-04-15 13:05:49,841 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-15 13:05:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:49,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324207301] [2022-04-15 13:05:49,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324207301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:49,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:49,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:05:49,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:49,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [768015437] [2022-04-15 13:05:49,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [768015437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:49,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:49,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:05:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462060798] [2022-04-15 13:05:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:05:49,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:49,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:49,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:49,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:05:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:05:49,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:05:49,922 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:50,549 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2022-04-15 13:05:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:05:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:05:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-15 13:05:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-15 13:05:50,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 96 transitions. [2022-04-15 13:05:50,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:50,649 INFO L225 Difference]: With dead ends: 105 [2022-04-15 13:05:50,649 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 13:05:50,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:05:50,650 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 85 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:50,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 42 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:05:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 13:05:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2022-04-15 13:05:50,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:50,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:50,788 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:50,788 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:50,791 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 13:05:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 13:05:50,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:50,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:50,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 80 states. [2022-04-15 13:05:50,792 INFO L87 Difference]: Start difference. First operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 80 states. [2022-04-15 13:05:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:50,795 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 13:05:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 13:05:50,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:50,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:50,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:50,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2022-04-15 13:05:50,798 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 25 [2022-04-15 13:05:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:50,799 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2022-04-15 13:05:50,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:50,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 96 transitions. [2022-04-15 13:05:50,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2022-04-15 13:05:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:05:50,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:50,908 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:50,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 13:05:50,908 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2069301023, now seen corresponding path program 1 times [2022-04-15 13:05:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:50,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122791008] [2022-04-15 13:05:50,977 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash -893958590, now seen corresponding path program 1 times [2022-04-15 13:05:50,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:50,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93553681] [2022-04-15 13:05:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:51,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {2488#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {2476#(<= 200000 ~SIZE~0)} assume true; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2476#(<= 200000 ~SIZE~0)} {2471#true} #90#return; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:51,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {2471#true} ~cond := #in~cond; {2471#true} is VALID [2022-04-15 13:05:51,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {2471#true} assume !(0 == ~cond); {2471#true} is VALID [2022-04-15 13:05:51,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {2471#true} assume true; {2471#true} is VALID [2022-04-15 13:05:51,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2471#true} {2476#(<= 200000 ~SIZE~0)} #86#return; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {2471#true} call ULTIMATE.init(); {2488#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:51,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {2488#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {2476#(<= 200000 ~SIZE~0)} assume true; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2476#(<= 200000 ~SIZE~0)} {2471#true} #90#return; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {2476#(<= 200000 ~SIZE~0)} call #t~ret7 := main(); {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {2476#(<= 200000 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {2476#(<= 200000 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {2471#true} is VALID [2022-04-15 13:05:51,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {2471#true} ~cond := #in~cond; {2471#true} is VALID [2022-04-15 13:05:51,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {2471#true} assume !(0 == ~cond); {2471#true} is VALID [2022-04-15 13:05:51,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {2471#true} assume true; {2471#true} is VALID [2022-04-15 13:05:51,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2471#true} {2476#(<= 200000 ~SIZE~0)} #86#return; {2476#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:51,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(<= 200000 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {2481#(and (= main_~a~0 0) (= main_~b~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:51,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {2481#(and (= main_~a~0 0) (= main_~b~0 0) (<= 200000 ~SIZE~0))} assume !false;~st~0 := 1;~c~0 := 0; {2482#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:51,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {2482#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0) (<= 200000 ~SIZE~0))} [104] L27-3-->L27-4_primed: Formula: (or (and (= v_~last~0_In_6 v_~last~0_In_6) (= v_main_~c~0_In_6 v_main_~c~0_Out_12) (= v_~SIZE~0_In_6 v_~SIZE~0_In_6)) (and (= v_~last~0_In_6 0) (= |v_main_#t~post5_Out_12| 0) (= v_main_~c~0_Out_12 v_main_~c~0_In_6) (< v_main_~c~0_Out_12 (+ v_~last~0_In_6 1)) (< v_main_~c~0_Out_12 (+ v_~SIZE~0_In_6 1)) (= v_main_~c~0_Out_12 0))) InVars {~SIZE~0=v_~SIZE~0_In_6, main_~c~0=v_main_~c~0_In_6, ~last~0=v_~last~0_In_6} OutVars{~SIZE~0=v_~SIZE~0_In_6, main_#t~post5=|v_main_#t~post5_Out_12|, main_~c~0=v_main_~c~0_Out_12, ~last~0=v_~last~0_In_6} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {2483#(and (or (not (= main_~c~0 0)) (<= 200000 ~SIZE~0)) (or (= main_~c~0 0) (and (= main_~a~0 0) (< main_~c~0 (+ ~SIZE~0 1)) (= main_~b~0 0))))} is VALID [2022-04-15 13:05:51,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#(and (or (not (= main_~c~0 0)) (<= 200000 ~SIZE~0)) (or (= main_~c~0 0) (and (= main_~a~0 0) (< main_~c~0 (+ ~SIZE~0 1)) (= main_~b~0 0))))} [103] L27-4_primed-->L27-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {2484#(and (= main_~a~0 0) (not (= main_~c~0 0)) (= main_~b~0 0) (= ~SIZE~0 main_~c~0))} is VALID [2022-04-15 13:05:51,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {2484#(and (= main_~a~0 0) (not (= main_~c~0 0)) (= main_~b~0 0) (= ~SIZE~0 main_~c~0))} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {2485#(and (not (= main_~c~0 0)) (= ~SIZE~0 main_~c~0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 13:05:51,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {2485#(and (not (= main_~c~0 0)) (= ~SIZE~0 main_~c~0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {2485#(and (not (= main_~c~0 0)) (= ~SIZE~0 main_~c~0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 13:05:51,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {2485#(and (not (= main_~c~0 0)) (= ~SIZE~0 main_~c~0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume 1 == ~st~0 && ~last~0 < ~SIZE~0;#t~post6 := ~d~0;~d~0 := 1 + #t~post6;havoc #t~post6; {2485#(and (not (= main_~c~0 0)) (= ~SIZE~0 main_~c~0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 13:05:51,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {2485#(and (not (= main_~c~0 0)) (= ~SIZE~0 main_~c~0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !(~d~0 == ~SIZE~0); {2485#(and (not (= main_~c~0 0)) (= ~SIZE~0 main_~c~0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 13:05:51,216 INFO L272 TraceCheckUtils]: 19: Hoare triple {2485#(and (not (= main_~c~0 0)) (= ~SIZE~0 main_~c~0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {2486#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:05:51,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {2486#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2487#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:05:51,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {2487#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2472#false} is VALID [2022-04-15 13:05:51,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#false} assume !false; {2472#false} is VALID [2022-04-15 13:05:51,217 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-15 13:05:51,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:51,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93553681] [2022-04-15 13:05:51,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93553681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:51,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:51,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:05:51,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:51,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122791008] [2022-04-15 13:05:51,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122791008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:51,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:51,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:05:51,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593622311] [2022-04-15 13:05:51,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:05:51,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:51,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:51,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:51,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:05:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:05:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:05:51,318 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:51,951 INFO L93 Difference]: Finished difference Result 156 states and 205 transitions. [2022-04-15 13:05:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:05:51,952 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-15 13:05:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-15 13:05:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-15 13:05:51,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2022-04-15 13:05:52,020 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-15 13:05:52,022 INFO L225 Difference]: With dead ends: 156 [2022-04-15 13:05:52,023 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 13:05:52,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:05:52,024 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:52,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 51 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:05:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 13:05:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2022-04-15 13:05:52,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:52,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:52,199 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:52,201 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:52,204 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2022-04-15 13:05:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-04-15 13:05:52,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:52,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:52,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 93 states. [2022-04-15 13:05:52,205 INFO L87 Difference]: Start difference. First operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 93 states. [2022-04-15 13:05:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:52,208 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2022-04-15 13:05:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-04-15 13:05:52,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:52,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:52,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:52,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2022-04-15 13:05:52,211 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 25 [2022-04-15 13:05:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:52,212 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2022-04-15 13:05:52,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:52,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 102 transitions. [2022-04-15 13:05:52,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 13:05:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:05:52,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:52,340 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:52,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 13:05:52,340 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1640504642, now seen corresponding path program 2 times [2022-04-15 13:05:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:52,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [269806045] [2022-04-15 13:05:52,457 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash 259677698, now seen corresponding path program 1 times [2022-04-15 13:05:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:52,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265594717] [2022-04-15 13:05:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:52,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {3169#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {3161#(<= 200000 ~SIZE~0)} assume true; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3161#(<= 200000 ~SIZE~0)} {3156#true} #90#return; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:05:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:52,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {3156#true} ~cond := #in~cond; {3156#true} is VALID [2022-04-15 13:05:52,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {3156#true} assume !(0 == ~cond); {3156#true} is VALID [2022-04-15 13:05:52,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {3156#true} assume true; {3156#true} is VALID [2022-04-15 13:05:52,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3156#true} {3161#(<= 200000 ~SIZE~0)} #86#return; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {3156#true} call ULTIMATE.init(); {3169#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:52,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {3169#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~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(18, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 200000; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {3161#(<= 200000 ~SIZE~0)} assume true; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3161#(<= 200000 ~SIZE~0)} {3156#true} #90#return; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {3161#(<= 200000 ~SIZE~0)} call #t~ret7 := main(); {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {3161#(<= 200000 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,598 INFO L272 TraceCheckUtils]: 6: Hoare triple {3161#(<= 200000 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {3156#true} is VALID [2022-04-15 13:05:52,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {3156#true} ~cond := #in~cond; {3156#true} is VALID [2022-04-15 13:05:52,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {3156#true} assume !(0 == ~cond); {3156#true} is VALID [2022-04-15 13:05:52,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {3156#true} assume true; {3156#true} is VALID [2022-04-15 13:05:52,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3156#true} {3161#(<= 200000 ~SIZE~0)} #86#return; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {3161#(<= 200000 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {3161#(<= 200000 ~SIZE~0)} is VALID [2022-04-15 13:05:52,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {3161#(<= 200000 ~SIZE~0)} assume !false;~st~0 := 1;~c~0 := 0; {3166#(and (= main_~c~0 0) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:52,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {3166#(and (= main_~c~0 0) (<= 200000 ~SIZE~0))} [106] L27-3-->L27-4_primed: Formula: (or (and (= v_main_~c~0_In_7 v_main_~c~0_Out_14) (= v_~last~0_In_7 v_~last~0_In_7) (= v_~SIZE~0_In_7 v_~SIZE~0_In_7)) (and (= v_main_~c~0_Out_14 v_main_~c~0_In_7) (= |v_main_#t~post5_Out_14| 0) (= v_main_~st~0_Out_8 0) (= v_~last~0_In_7 0) (= v_main_~c~0_Out_14 0) (<= (+ v_~last~0_In_7 1) v_main_~c~0_Out_14) (< v_main_~c~0_Out_14 (+ v_~SIZE~0_In_7 1)))) InVars {~SIZE~0=v_~SIZE~0_In_7, main_~c~0=v_main_~c~0_In_7, ~last~0=v_~last~0_In_7} OutVars{~SIZE~0=v_~SIZE~0_In_7, main_#t~post5=|v_main_#t~post5_Out_14|, main_~c~0=v_main_~c~0_Out_14, main_~st~0=v_main_~st~0_Out_8, ~last~0=v_~last~0_In_7} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {3167#(and (or (<= ~last~0 0) (= main_~c~0 0)) (<= 200000 ~SIZE~0))} is VALID [2022-04-15 13:05:52,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#(and (or (<= ~last~0 0) (= main_~c~0 0)) (<= 200000 ~SIZE~0))} [105] L27-4_primed-->L27-4: Formula: (not (< v_main_~c~0_11 v_~SIZE~0_3)) InVars {~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} OutVars{~SIZE~0=v_~SIZE~0_3, main_~c~0=v_main_~c~0_11} AuxVars[] AssignedVars[] {3168#(and (<= ~last~0 0) (<= 200000 main_~c~0))} is VALID [2022-04-15 13:05:52,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {3168#(and (<= ~last~0 0) (<= 200000 main_~c~0))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {3157#false} is VALID [2022-04-15 13:05:52,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {3157#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {3157#false} is VALID [2022-04-15 13:05:52,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {3157#false} assume !(1 == ~st~0 && ~last~0 < ~SIZE~0); {3157#false} is VALID [2022-04-15 13:05:52,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {3157#false} assume !(~d~0 == ~SIZE~0); {3157#false} is VALID [2022-04-15 13:05:52,603 INFO L272 TraceCheckUtils]: 19: Hoare triple {3157#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {3157#false} is VALID [2022-04-15 13:05:52,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {3157#false} ~cond := #in~cond; {3157#false} is VALID [2022-04-15 13:05:52,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {3157#false} assume 0 == ~cond; {3157#false} is VALID [2022-04-15 13:05:52,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {3157#false} assume !false; {3157#false} is VALID [2022-04-15 13:05:52,604 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-15 13:05:52,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:52,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265594717] [2022-04-15 13:05:52,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265594717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:52,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:52,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:05:52,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:52,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [269806045] [2022-04-15 13:05:52,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [269806045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:52,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:52,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:05:52,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887141127] [2022-04-15 13:05:52,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:52,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-15 13:05:52,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:52,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:52,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:52,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:05:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:05:52,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:05:52,735 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:53,242 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2022-04-15 13:05:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:05:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-15 13:05:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 13:05:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 13:05:53,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-15 13:05:53,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:53,300 INFO L225 Difference]: With dead ends: 161 [2022-04-15 13:05:53,300 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 13:05:53,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:05:53,301 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:53,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 32 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:05:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 13:05:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-15 13:05:53,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:53,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:53,451 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:53,451 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:53,460 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2022-04-15 13:05:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-04-15 13:05:53,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:53,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:53,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 98 states. [2022-04-15 13:05:53,461 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 98 states. [2022-04-15 13:05:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:53,465 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2022-04-15 13:05:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-04-15 13:05:53,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:53,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:53,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:53,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:05:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2022-04-15 13:05:53,467 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 28 [2022-04-15 13:05:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:53,468 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2022-04-15 13:05:53,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:05:53,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 111 transitions. [2022-04-15 13:05:53,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2022-04-15 13:05:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:05:53,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:53,597 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:53,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 13:05:53,598 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:53,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1643345404, now seen corresponding path program 1 times [2022-04-15 13:05:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:53,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [814617544] [2022-04-15 13:05:53,831 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:05:53,837 INFO L158 Benchmark]: Toolchain (without parser) took 9874.15ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 120.6MB in the beginning and 163.6MB in the end (delta: -43.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:05:53,837 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:05:53,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.27ms. Allocated memory is still 169.9MB. Free memory was 120.3MB in the beginning and 148.1MB in the end (delta: -27.8MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-15 13:05:53,837 INFO L158 Benchmark]: Boogie Preprocessor took 29.06ms. Allocated memory is still 169.9MB. Free memory was 148.1MB in the beginning and 146.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:05:53,838 INFO L158 Benchmark]: RCFGBuilder took 282.01ms. Allocated memory is still 169.9MB. Free memory was 146.7MB in the beginning and 134.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 13:05:53,838 INFO L158 Benchmark]: TraceAbstraction took 9316.17ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 134.1MB in the beginning and 163.6MB in the end (delta: -29.5MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2022-04-15 13:05:53,839 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.19ms. Allocated memory is still 169.9MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.27ms. Allocated memory is still 169.9MB. Free memory was 120.3MB in the beginning and 148.1MB in the end (delta: -27.8MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.06ms. Allocated memory is still 169.9MB. Free memory was 148.1MB in the beginning and 146.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 282.01ms. Allocated memory is still 169.9MB. Free memory was 146.7MB in the beginning and 134.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9316.17ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 134.1MB in the beginning and 163.6MB in the end (delta: -29.5MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:05:53,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...