/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/loop-simple/nested_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:14:41,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:14:41,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:14:41,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:14:41,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:14:41,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:14:41,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:14:41,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:14:41,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:14:41,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:14:41,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:14:41,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:14:41,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:14:41,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:14:41,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:14:41,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:14:41,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:14:41,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:14:41,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:14:41,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:14:41,423 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:14:41,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:14:41,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:14:41,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:14:41,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:14:41,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:14:41,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:14:41,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:14:41,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:14:41,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:14:41,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:14:41,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:14:41,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:14:41,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:14:41,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:14:41,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:14:41,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:14:41,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:14:41,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:14:41,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:14:41,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:14:41,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:14:41,443 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:14:41,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:14:41,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:14:41,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:14:41,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:14:41,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:14:41,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:14:41,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:14:41,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:14:41,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:14:41,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:14:41,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:14:41,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:14:41,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:14:41,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:14:41,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:14:41,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:14:41,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:14:41,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:14:41,456 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:14:41,456 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:14:41,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:14:41,457 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:14:41,457 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:14:41,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:14:41,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:14:41,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:14:41,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:14:41,698 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:14:41,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_5.c [2022-04-15 13:14:41,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be51d52a7/ada025b388894a279e530d460bf5ac51/FLAGe05d49c46 [2022-04-15 13:14:42,106 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:14:42,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_5.c [2022-04-15 13:14:42,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be51d52a7/ada025b388894a279e530d460bf5ac51/FLAGe05d49c46 [2022-04-15 13:14:42,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be51d52a7/ada025b388894a279e530d460bf5ac51 [2022-04-15 13:14:42,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:14:42,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:14:42,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:14:42,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:14:42,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:14:42,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7629af7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42, skipping insertion in model container [2022-04-15 13:14:42,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:14:42,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:14:42,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_5.c[899,912] [2022-04-15 13:14:42,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:14:42,744 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:14:42,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_5.c[899,912] [2022-04-15 13:14:42,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:14:42,768 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:14:42,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42 WrapperNode [2022-04-15 13:14:42,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:14:42,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:14:42,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:14:42,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:14:42,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:14:42,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:14:42,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:14:42,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:14:42,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (1/1) ... [2022-04-15 13:14:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:14:42,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:42,829 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:14:42,840 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:14:42,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:14:42,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:14:42,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:14:42,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:14:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:14:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:14:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:14:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:14:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:14:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:14:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:14:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:14:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:14:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:14:42,924 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:14:42,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:14:43,028 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:14:43,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:14:43,035 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 13:14:43,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:14:43 BoogieIcfgContainer [2022-04-15 13:14:43,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:14:43,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:14:43,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:14:43,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:14:43,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:14:42" (1/3) ... [2022-04-15 13:14:43,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610eccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:14:43, skipping insertion in model container [2022-04-15 13:14:43,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:42" (2/3) ... [2022-04-15 13:14:43,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610eccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:14:43, skipping insertion in model container [2022-04-15 13:14:43,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:14:43" (3/3) ... [2022-04-15 13:14:43,043 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_5.c [2022-04-15 13:14:43,047 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:14:43,047 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:14:43,082 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:14:43,088 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:14:43,089 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:14:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:14:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 13:14:43,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:43,110 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:43,111 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1327885715, now seen corresponding path program 1 times [2022-04-15 13:14:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:43,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744926471] [2022-04-15 13:14:43,131 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:14:43,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1327885715, now seen corresponding path program 2 times [2022-04-15 13:14:43,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:43,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372463226] [2022-04-15 13:14:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:43,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 13:14:43,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:14:43,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-15 13:14:43,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:43,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 13:14:43,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:14:43,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-15 13:14:43,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret9 := main(); {27#true} is VALID [2022-04-15 13:14:43,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {27#true} is VALID [2022-04-15 13:14:43,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 13:14:43,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {28#false} is VALID [2022-04-15 13:14:43,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 13:14:43,290 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:14:43,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:43,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372463226] [2022-04-15 13:14:43,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372463226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:43,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:43,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:14:43,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:43,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744926471] [2022-04-15 13:14:43,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744926471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:43,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:43,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:14:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418576694] [2022-04-15 13:14:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:43,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:43,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:43,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:43,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:14:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:43,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:14:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:14:43,373 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,483 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2022-04-15 13:14:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:14:43,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-15 13:14:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-15 13:14:43,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-04-15 13:14:43,574 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:14:43,584 INFO L225 Difference]: With dead ends: 42 [2022-04-15 13:14:43,584 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:14:43,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:14:43,594 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:43,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:14:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:14:43,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:43,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,618 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,618 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,620 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-04-15 13:14:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-15 13:14:43,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:43,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:43,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:14:43,622 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:14:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,624 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-04-15 13:14:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-15 13:14:43,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:43,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:43,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:43,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-15 13:14:43,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2022-04-15 13:14:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:43,629 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-15 13:14:43,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2022-04-15 13:14:43,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-15 13:14:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 13:14:43,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:43,670 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:43,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:14:43,670 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1327937609, now seen corresponding path program 1 times [2022-04-15 13:14:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:43,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [95369736] [2022-04-15 13:14:43,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:14:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1327937609, now seen corresponding path program 2 times [2022-04-15 13:14:43,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:43,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72831276] [2022-04-15 13:14:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:43,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:43,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {195#true} is VALID [2022-04-15 13:14:43,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-15 13:14:43,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {195#true} {195#true} #80#return; {195#true} is VALID [2022-04-15 13:14:43,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:43,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {195#true} is VALID [2022-04-15 13:14:43,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-15 13:14:43,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #80#return; {195#true} is VALID [2022-04-15 13:14:43,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret9 := main(); {195#true} is VALID [2022-04-15 13:14:43,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {200#(= main_~a~0 0)} is VALID [2022-04-15 13:14:43,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#(= main_~a~0 0)} assume !(~a~0 < 6); {196#false} is VALID [2022-04-15 13:14:43,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {196#false} is VALID [2022-04-15 13:14:43,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-04-15 13:14:43,738 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:14:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:43,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72831276] [2022-04-15 13:14:43,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72831276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:43,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:43,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:43,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [95369736] [2022-04-15 13:14:43,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [95369736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:43,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:43,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632190456] [2022-04-15 13:14:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:43,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:43,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:43,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:43,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:43,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:43,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:43,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:43,762 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,840 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 13:14:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:43,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 13:14:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-15 13:14:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-15 13:14:43,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-15 13:14:43,881 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:14:43,882 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:14:43,882 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:14:43,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:14:43,884 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:43,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 28 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:14:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-04-15 13:14:43,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:43,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,890 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,891 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,893 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-15 13:14:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-15 13:14:43,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:43,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:43,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 13:14:43,894 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 13:14:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:43,895 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-15 13:14:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-15 13:14:43,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:43,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:43,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:43,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 13:14:43,898 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2022-04-15 13:14:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:43,898 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 13:14:43,898 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:43,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 13:14:43,922 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:14:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 13:14:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:14:43,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:43,923 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:43,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:14:43,923 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 365342218, now seen corresponding path program 1 times [2022-04-15 13:14:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:43,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1361256603] [2022-04-15 13:14:44,027 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1785733815, now seen corresponding path program 1 times [2022-04-15 13:14:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:44,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109296832] [2022-04-15 13:14:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:44,046 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:44,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash 365342218, now seen corresponding path program 2 times [2022-04-15 13:14:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:44,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345612509] [2022-04-15 13:14:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:44,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:44,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-15 13:14:44,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-15 13:14:44,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} #80#return; {368#true} is VALID [2022-04-15 13:14:44,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:44,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-15 13:14:44,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-15 13:14:44,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #80#return; {368#true} is VALID [2022-04-15 13:14:44,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret9 := main(); {368#true} is VALID [2022-04-15 13:14:44,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {368#true} is VALID [2022-04-15 13:14:44,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#true} assume !!(~a~0 < 6);~b~0 := 0; {373#(= main_~b~0 0)} is VALID [2022-04-15 13:14:44,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(= main_~b~0 0)} assume !(~b~0 < 6); {369#false} is VALID [2022-04-15 13:14:44,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {369#false} is VALID [2022-04-15 13:14:44,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#false} assume !(~a~0 < 6); {369#false} is VALID [2022-04-15 13:14:44,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {369#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {369#false} is VALID [2022-04-15 13:14:44,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-15 13:14:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:44,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345612509] [2022-04-15 13:14:44,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345612509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:44,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:44,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:44,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:44,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1361256603] [2022-04-15 13:14:44,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1361256603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:44,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:44,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822627466] [2022-04-15 13:14:44,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:14:44,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:44,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:44,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:44,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:44,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:44,148 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:44,227 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 13:14:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:14:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 13:14:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 13:14:44,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-15 13:14:44,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:44,277 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:14:44,277 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:14:44,278 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:14:44,279 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:44,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 28 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:14:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2022-04-15 13:14:44,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:44,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,285 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,285 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:44,286 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-15 13:14:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 13:14:44,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:44,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:44,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 13:14:44,288 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 13:14:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:44,289 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-15 13:14:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 13:14:44,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:44,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:44,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:44,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-15 13:14:44,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2022-04-15 13:14:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:44,291 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-15 13:14:44,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-15 13:14:44,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:14:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 13:14:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:14:44,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:44,318 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:44,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2022-04-15 13:14:44,319 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash -903990269, now seen corresponding path program 1 times [2022-04-15 13:14:44,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:44,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674139405] [2022-04-15 13:14:44,645 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:14:44,645 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:14:44,645 INFO L85 PathProgramCache]: Analyzing trace with hash -903990269, now seen corresponding path program 2 times [2022-04-15 13:14:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:44,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047555478] [2022-04-15 13:14:44,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:44,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:44,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {559#true} is VALID [2022-04-15 13:14:44,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {559#true} assume true; {559#true} is VALID [2022-04-15 13:14:44,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {559#true} {559#true} #80#return; {559#true} is VALID [2022-04-15 13:14:44,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {559#true} call ULTIMATE.init(); {565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:44,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {559#true} is VALID [2022-04-15 13:14:44,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {559#true} assume true; {559#true} is VALID [2022-04-15 13:14:44,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {559#true} {559#true} #80#return; {559#true} is VALID [2022-04-15 13:14:44,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {559#true} call #t~ret9 := main(); {559#true} is VALID [2022-04-15 13:14:44,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {559#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {559#true} is VALID [2022-04-15 13:14:44,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {559#true} assume !!(~a~0 < 6);~b~0 := 0; {559#true} is VALID [2022-04-15 13:14:44,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {559#true} assume !!(~b~0 < 6);~c~0 := 0; {564#(= main_~c~0 0)} is VALID [2022-04-15 13:14:44,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(= main_~c~0 0)} assume !(~c~0 < 6); {560#false} is VALID [2022-04-15 13:14:44,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {560#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {560#false} is VALID [2022-04-15 13:14:44,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {560#false} assume !(~b~0 < 6); {560#false} is VALID [2022-04-15 13:14:44,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {560#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {560#false} is VALID [2022-04-15 13:14:44,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {560#false} assume !(~a~0 < 6); {560#false} is VALID [2022-04-15 13:14:44,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {560#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {560#false} is VALID [2022-04-15 13:14:44,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {560#false} assume !false; {560#false} is VALID [2022-04-15 13:14:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:44,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:44,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047555478] [2022-04-15 13:14:44,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047555478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:44,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:44,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:44,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:44,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674139405] [2022-04-15 13:14:44,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674139405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:44,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:44,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:44,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688060935] [2022-04-15 13:14:44,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:44,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:14:44,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:44,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:44,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:44,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:44,710 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:44,799 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 13:14:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:44,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:14:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-04-15 13:14:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-04-15 13:14:44,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-04-15 13:14:44,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:44,855 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:14:44,855 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:14:44,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:14:44,858 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:44,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 28 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:14:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-04-15 13:14:44,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:44,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,869 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,869 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:44,870 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 13:14:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:14:44,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:44,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:44,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 13:14:44,871 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 13:14:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:44,872 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 13:14:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:14:44,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:44,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:44,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:44,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-15 13:14:44,874 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-04-15 13:14:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:44,874 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-15 13:14:44,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:44,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-15 13:14:44,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 13:14:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:14:44,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:44,898 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:44,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 13:14:44,899 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash 761147182, now seen corresponding path program 1 times [2022-04-15 13:14:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:44,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852351680] [2022-04-15 13:15:37,721 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:15:37,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1785795319, now seen corresponding path program 1 times [2022-04-15 13:15:37,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:37,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79611585] [2022-04-15 13:15:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:37,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:15:37,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:15:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:15:37,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:15:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash 761147182, now seen corresponding path program 2 times [2022-04-15 13:15:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:37,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931640875] [2022-04-15 13:15:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:15:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:37,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {750#true} is VALID [2022-04-15 13:15:37,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {750#true} assume true; {750#true} is VALID [2022-04-15 13:15:37,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {750#true} {750#true} #80#return; {750#true} is VALID [2022-04-15 13:15:37,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:15:37,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {750#true} is VALID [2022-04-15 13:15:37,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2022-04-15 13:15:37,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #80#return; {750#true} is VALID [2022-04-15 13:15:37,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret9 := main(); {750#true} is VALID [2022-04-15 13:15:37,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {750#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {750#true} is VALID [2022-04-15 13:15:37,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {750#true} assume !!(~a~0 < 6);~b~0 := 0; {750#true} is VALID [2022-04-15 13:15:37,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {750#true} assume !!(~b~0 < 6);~c~0 := 0; {750#true} is VALID [2022-04-15 13:15:37,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {750#true} assume !!(~c~0 < 6);~d~0 := 0; {755#(= main_~d~0 0)} is VALID [2022-04-15 13:15:37,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#(= main_~d~0 0)} assume !(~d~0 < 6); {751#false} is VALID [2022-04-15 13:15:37,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {751#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {751#false} is VALID [2022-04-15 13:15:37,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {751#false} assume !(~c~0 < 6); {751#false} is VALID [2022-04-15 13:15:37,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {751#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {751#false} is VALID [2022-04-15 13:15:37,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {751#false} assume !(~b~0 < 6); {751#false} is VALID [2022-04-15 13:15:37,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {751#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {751#false} is VALID [2022-04-15 13:15:37,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {751#false} assume !(~a~0 < 6); {751#false} is VALID [2022-04-15 13:15:37,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {751#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {751#false} is VALID [2022-04-15 13:15:37,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {751#false} assume !false; {751#false} is VALID [2022-04-15 13:15:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:15:37,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:37,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931640875] [2022-04-15 13:15:37,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931640875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:37,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:37,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:37,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:37,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852351680] [2022-04-15 13:15:37,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852351680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:37,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:37,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291396317] [2022-04-15 13:15:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:15:37,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:37,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:37,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:15:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:37,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:15:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:15:37,824 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:37,899 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-15 13:15:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:15:37,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:15:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 13:15:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 13:15:37,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-15 13:15:37,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:37,938 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:15:37,938 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 13:15:37,939 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:15:37,939 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:37,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 28 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:15:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 13:15:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-04-15 13:15:37,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:37,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,945 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,945 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:37,946 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 13:15:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 13:15:37,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:37,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:37,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:15:37,947 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:15:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:37,948 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 13:15:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 13:15:37,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:37,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:37,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:37,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-15 13:15:37,950 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2022-04-15 13:15:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:37,950 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-15 13:15:37,950 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:37,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-15 13:15:37,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:15:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:15:37,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:37,977 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:15:37,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2022-04-15 13:15:37,978 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash 317096575, now seen corresponding path program 1 times [2022-04-15 13:15:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:37,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [960414799] [2022-04-15 13:15:51,194 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:15:51,194 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:15:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 317096575, now seen corresponding path program 2 times [2022-04-15 13:15:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:51,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671244267] [2022-04-15 13:15:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:51,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:15:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:51,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {941#true} is VALID [2022-04-15 13:15:51,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-15 13:15:51,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {941#true} {941#true} #80#return; {941#true} is VALID [2022-04-15 13:15:51,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:15:51,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {941#true} is VALID [2022-04-15 13:15:51,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-15 13:15:51,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #80#return; {941#true} is VALID [2022-04-15 13:15:51,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret9 := main(); {941#true} is VALID [2022-04-15 13:15:51,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {941#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {941#true} is VALID [2022-04-15 13:15:51,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {941#true} assume !!(~a~0 < 6);~b~0 := 0; {941#true} is VALID [2022-04-15 13:15:51,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {941#true} assume !!(~b~0 < 6);~c~0 := 0; {941#true} is VALID [2022-04-15 13:15:51,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {941#true} assume !!(~c~0 < 6);~d~0 := 0; {941#true} is VALID [2022-04-15 13:15:51,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {941#true} assume !!(~d~0 < 6);~e~0 := 0; {946#(= main_~e~0 0)} is VALID [2022-04-15 13:15:51,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {946#(= main_~e~0 0)} assume !(~e~0 < 6); {942#false} is VALID [2022-04-15 13:15:51,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {942#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {942#false} is VALID [2022-04-15 13:15:51,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {942#false} assume !(~d~0 < 6); {942#false} is VALID [2022-04-15 13:15:51,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {942#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {942#false} is VALID [2022-04-15 13:15:51,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {942#false} assume !(~c~0 < 6); {942#false} is VALID [2022-04-15 13:15:51,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {942#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {942#false} is VALID [2022-04-15 13:15:51,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {942#false} assume !(~b~0 < 6); {942#false} is VALID [2022-04-15 13:15:51,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {942#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {942#false} is VALID [2022-04-15 13:15:51,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {942#false} assume !(~a~0 < 6); {942#false} is VALID [2022-04-15 13:15:51,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {942#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {942#false} is VALID [2022-04-15 13:15:51,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#false} assume !false; {942#false} is VALID [2022-04-15 13:15:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:15:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:51,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671244267] [2022-04-15 13:15:51,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671244267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:51,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:51,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:51,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:51,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [960414799] [2022-04-15 13:15:51,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [960414799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:51,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:51,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178724494] [2022-04-15 13:15:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:51,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:15:51,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:51,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,275 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:15:51,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:15:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:15:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:15:51,277 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:51,338 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 13:15:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:15:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:15:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 13:15:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 13:15:51,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-15 13:15:51,372 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:15:51,375 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:15:51,375 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:15:51,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:15:51,376 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:51,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:15:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:15:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 13:15:51,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:51,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,385 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,385 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:51,386 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 13:15:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 13:15:51,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:51,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:51,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:15:51,390 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:15:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:51,391 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 13:15:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 13:15:51,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:51,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:51,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:51,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-15 13:15:51,395 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21 [2022-04-15 13:15:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:51,395 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-15 13:15:51,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:51,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-15 13:15:51,420 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:15:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 13:15:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:15:51,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:51,421 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] [2022-04-15 13:15:51,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 13:15:51,421 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash 720998685, now seen corresponding path program 1 times [2022-04-15 13:15:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:51,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [803659444]