/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_1b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:06:43,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:06:43,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:06:43,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:06:43,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:06:43,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:06:43,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:06:43,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:06:43,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:06:43,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:06:43,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:06:43,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:06:43,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:06:43,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:06:43,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:06:43,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:06:43,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:06:43,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:06:43,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:06:43,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:06:43,611 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:06:43,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:06:43,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:06:43,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:06:43,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:06:43,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:06:43,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:06:43,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:06:43,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:06:43,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:06:43,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:06:43,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:06:43,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:06:43,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:06:43,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:06:43,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:06:43,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:06:43,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:06:43,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:06:43,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:06:43,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:06:43,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:06:43,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:06:43,633 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:06:43,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:06:43,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:06:43,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:06:43,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:06:43,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:06:43,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:06:43,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:06:43,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:06:43,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:06:43,637 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:06:43,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:06:43,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:06:43,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:06:43,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:06:43,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:06:43,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:06:43,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:06:43,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:06:43,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:06:43,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:06:43,639 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:06:43,639 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:06:43,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:06:43,639 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:06:43,639 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:06:43,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:06:43,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:06:43,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:06:43,845 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:06:43,847 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:06:43,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_1b.c [2022-04-28 04:06:43,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1563169b/b575adef0277419b8293e552dd08c96d/FLAG5a5e21c19 [2022-04-28 04:06:44,213 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:06:44,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1b.c [2022-04-28 04:06:44,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1563169b/b575adef0277419b8293e552dd08c96d/FLAG5a5e21c19 [2022-04-28 04:06:44,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1563169b/b575adef0277419b8293e552dd08c96d [2022-04-28 04:06:44,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:06:44,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:06:44,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:06:44,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:06:44,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:06:44,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2889bb82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44, skipping insertion in model container [2022-04-28 04:06:44,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:06:44,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:06:44,801 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_1b.c[674,687] [2022-04-28 04:06:44,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:06:44,812 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:06:44,824 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_1b.c[674,687] [2022-04-28 04:06:44,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:06:44,835 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:06:44,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44 WrapperNode [2022-04-28 04:06:44,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:06:44,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:06:44,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:06:44,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:06:44,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:06:44,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:06:44,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:06:44,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:06:44,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (1/1) ... [2022-04-28 04:06:44,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:06:44,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:44,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:06:44,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:06:44,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:06:44,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:06:44,924 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:06:44,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:06:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:06:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:06:44,967 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:06:44,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:06:45,036 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:06:45,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:06:45,042 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:06:45,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:06:45 BoogieIcfgContainer [2022-04-28 04:06:45,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:06:45,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:06:45,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:06:45,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:06:45,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:06:44" (1/3) ... [2022-04-28 04:06:45,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521e17f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:06:45, skipping insertion in model container [2022-04-28 04:06:45,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:44" (2/3) ... [2022-04-28 04:06:45,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521e17f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:06:45, skipping insertion in model container [2022-04-28 04:06:45,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:06:45" (3/3) ... [2022-04-28 04:06:45,063 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1b.c [2022-04-28 04:06:45,078 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:06:45,079 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:06:45,118 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:06:45,146 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ef6b241, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52530b8b [2022-04-28 04:06:45,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:06:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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-28 04:06:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:06:45,162 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:45,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:45,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 1 times [2022-04-28 04:06:45,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1231454648] [2022-04-28 04:06:45,182 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:06:45,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 2 times [2022-04-28 04:06:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:45,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955165520] [2022-04-28 04:06:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:45,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:45,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(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(12, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-04-28 04:06:45,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-28 04:06:45,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-28 04:06:45,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:45,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#(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(12, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-04-28 04:06:45,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-28 04:06:45,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-28 04:06:45,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret5 := main(); {19#true} is VALID [2022-04-28 04:06:45,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} ~a~0 := 6;~a~0 := 0; {19#true} is VALID [2022-04-28 04:06:45,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-04-28 04:06:45,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume 6 == ~a~0; {20#false} is VALID [2022-04-28 04:06:45,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-04-28 04:06:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:45,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955165520] [2022-04-28 04:06:45,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955165520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:45,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:45,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:06:45,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:45,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1231454648] [2022-04-28 04:06:45,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1231454648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:45,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:45,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:06:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982245804] [2022-04-28 04:06:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:45,379 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-28 04:06:45,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:45,383 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-28 04:06:45,419 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-28 04:06:45,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:06:45,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:06:45,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:06:45,452 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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-28 04:06:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:45,527 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 04:06:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:06:45,527 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-28 04:06:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:45,528 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-28 04:06:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-28 04:06:45,544 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-28 04:06:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-28 04:06:45,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-28 04:06:45,586 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-28 04:06:45,594 INFO L225 Difference]: With dead ends: 24 [2022-04-28 04:06:45,594 INFO L226 Difference]: Without dead ends: 11 [2022-04-28 04:06:45,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:06:45,601 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 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-28 04:06:45,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:06:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-04-28 04:06:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-04-28 04:06:45,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:45,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 04:06:45,625 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 04:06:45,626 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 04:06:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:45,633 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-28 04:06:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-28 04:06:45,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:45,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:45,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 11 states. [2022-04-28 04:06:45,635 INFO L87 Difference]: Start difference. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 11 states. [2022-04-28 04:06:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:45,641 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-28 04:06:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-28 04:06:45,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:45,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:45,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:45,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 04:06:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-04-28 04:06:45,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-04-28 04:06:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:45,646 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-04-28 04:06:45,646 INFO L496 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-28 04:06:45,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 11 transitions. [2022-04-28 04:06:45,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-28 04:06:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:06:45,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:45,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:45,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:06:45,668 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:45,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 1 times [2022-04-28 04:06:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:45,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427672463] [2022-04-28 04:06:45,677 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:06:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 2 times [2022-04-28 04:06:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:45,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948950653] [2022-04-28 04:06:45,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:45,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:45,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#(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(12, 2);call #Ultimate.allocInit(12, 3); {119#true} is VALID [2022-04-28 04:06:45,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume true; {119#true} is VALID [2022-04-28 04:06:45,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} #32#return; {119#true} is VALID [2022-04-28 04:06:45,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {119#true} call ULTIMATE.init(); {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:45,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#(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(12, 2);call #Ultimate.allocInit(12, 3); {119#true} is VALID [2022-04-28 04:06:45,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#true} assume true; {119#true} is VALID [2022-04-28 04:06:45,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119#true} {119#true} #32#return; {119#true} is VALID [2022-04-28 04:06:45,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {119#true} call #t~ret5 := main(); {119#true} is VALID [2022-04-28 04:06:45,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#true} ~a~0 := 6;~a~0 := 0; {124#(= main_~a~0 0)} is VALID [2022-04-28 04:06:45,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#(= main_~a~0 0)} assume !(~a~0 < 6); {120#false} is VALID [2022-04-28 04:06:45,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#false} assume 6 == ~a~0; {120#false} is VALID [2022-04-28 04:06:45,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-04-28 04:06:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:45,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948950653] [2022-04-28 04:06:45,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948950653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:45,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:45,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:06:45,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:45,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427672463] [2022-04-28 04:06:45,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427672463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:45,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:45,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:06:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232510389] [2022-04-28 04:06:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:45,772 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-28 04:06:45,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:45,772 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-28 04:06:45,784 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-28 04:06:45,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:06:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:06:45,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:06:45,786 INFO L87 Difference]: Start difference. First operand 11 states and 11 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-28 04:06:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:45,847 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 04:06:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:06:45,847 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-28 04:06:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:45,848 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-28 04:06:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-28 04:06:45,851 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-28 04:06:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-28 04:06:45,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2022-04-28 04:06:45,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:45,876 INFO L225 Difference]: With dead ends: 16 [2022-04-28 04:06:45,876 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 04:06:45,876 INFO L412 NwaCegarLoop]: 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-28 04:06:45,879 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:06:45,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:06:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 04:06:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-04-28 04:06:45,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:45,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 04:06:45,901 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 04:06:45,901 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 04:06:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:45,902 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 04:06:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 04:06:45,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:45,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:45,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 04:06:45,903 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 04:06:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:45,904 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 04:06:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 04:06:45,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:45,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:45,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:45,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 04:06:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-28 04:06:45,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-04-28 04:06:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:45,906 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-28 04:06:45,907 INFO L496 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-28 04:06:45,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-28 04:06:45,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 04:06:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:06:45,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:45,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:45,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:06:45,927 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1889274843, now seen corresponding path program 1 times [2022-04-28 04:06:45,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:45,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963306277] [2022-04-28 04:06:50,097 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:06:50,220 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:06:50,222 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:06:50,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1602266855, now seen corresponding path program 1 times [2022-04-28 04:06:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:50,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184671644] [2022-04-28 04:06:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:06:50,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 04:06:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:06:50,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 04:06:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1889274843, now seen corresponding path program 2 times [2022-04-28 04:06:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:50,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817881154] [2022-04-28 04:06:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:50,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:50,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#(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(12, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 04:06:50,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 04:06:50,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-28 04:06:50,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:50,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#(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(12, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 04:06:50,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 04:06:50,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-28 04:06:50,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-28 04:06:50,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {217#(= main_~a~0 0)} is VALID [2022-04-28 04:06:50,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~a~0 0)} assume !!(~a~0 < 6); {217#(= main_~a~0 0)} is VALID [2022-04-28 04:06:50,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {218#(<= main_~a~0 1)} is VALID [2022-04-28 04:06:50,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(<= main_~a~0 1)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-28 04:06:50,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-28 04:06:50,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 04:06:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:50,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:50,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817881154] [2022-04-28 04:06:50,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817881154] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:50,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718125540] [2022-04-28 04:06:50,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:06:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:50,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:06:50,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:06:50,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:06:50,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:50,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 04:06:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:50,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:50,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-28 04:06:50,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 04:06:50,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 04:06:50,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-28 04:06:50,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-28 04:06:50,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {238#(<= main_~a~0 0)} is VALID [2022-04-28 04:06:50,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#(<= main_~a~0 0)} assume !!(~a~0 < 6); {238#(<= main_~a~0 0)} is VALID [2022-04-28 04:06:50,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {218#(<= main_~a~0 1)} is VALID [2022-04-28 04:06:50,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(<= main_~a~0 1)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-28 04:06:50,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-28 04:06:50,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 04:06:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:50,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:50,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 04:06:50,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-28 04:06:50,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(< main_~a~0 6)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-28 04:06:50,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {260#(< main_~a~0 6)} is VALID [2022-04-28 04:06:50,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {264#(< main_~a~0 5)} assume !!(~a~0 < 6); {264#(< main_~a~0 5)} is VALID [2022-04-28 04:06:50,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {264#(< main_~a~0 5)} is VALID [2022-04-28 04:06:50,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-28 04:06:50,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-28 04:06:50,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 04:06:50,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 04:06:50,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-28 04:06:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:50,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718125540] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:50,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:50,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 04:06:50,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:50,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963306277] [2022-04-28 04:06:50,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963306277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:50,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:50,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:06:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491680349] [2022-04-28 04:06:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2022-04-28 04:06:50,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:50,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 04:06:50,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:50,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:06:50,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:50,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:06:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:06:50,559 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 04:06:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:50,610 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 04:06:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:06:50,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2022-04-28 04:06:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 04:06:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-28 04:06:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 04:06:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-28 04:06:50,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-04-28 04:06:50,630 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-28 04:06:50,631 INFO L225 Difference]: With dead ends: 18 [2022-04-28 04:06:50,631 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 04:06:50,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:06:50,633 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:06:50,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:06:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 04:06:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-28 04:06:50,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:50,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 04:06:50,638 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 04:06:50,638 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 04:06:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:50,639 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:06:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:06:50,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:50,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:50,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-28 04:06:50,640 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-28 04:06:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:50,641 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:06:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:06:50,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:50,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:50,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:50,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 04:06:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 04:06:50,643 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-28 04:06:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:50,643 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 04:06:50,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 04:06:50,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 04:06:50,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 04:06:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 04:06:50,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:50,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:50,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:06:50,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:50,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1179700547, now seen corresponding path program 3 times [2022-04-28 04:06:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:50,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777238663] [2022-04-28 04:06:54,967 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:06:55,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:06:55,075 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:06:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1602328359, now seen corresponding path program 1 times [2022-04-28 04:06:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:55,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378879884] [2022-04-28 04:06:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:06:55,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 04:06:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:06:55,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 04:06:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1179700547, now seen corresponding path program 4 times [2022-04-28 04:06:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:55,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481721130] [2022-04-28 04:06:55,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:55,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#(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(12, 2);call #Ultimate.allocInit(12, 3); {386#true} is VALID [2022-04-28 04:06:55,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-28 04:06:55,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-28 04:06:55,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:55,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#(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(12, 2);call #Ultimate.allocInit(12, 3); {386#true} is VALID [2022-04-28 04:06:55,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-28 04:06:55,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-28 04:06:55,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-28 04:06:55,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {391#(= main_~a~0 0)} is VALID [2022-04-28 04:06:55,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {391#(= main_~a~0 0)} assume !!(~a~0 < 6); {391#(= main_~a~0 0)} is VALID [2022-04-28 04:06:55,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {392#(<= main_~a~0 1)} is VALID [2022-04-28 04:06:55,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#(<= main_~a~0 1)} assume !!(~a~0 < 6); {392#(<= main_~a~0 1)} is VALID [2022-04-28 04:06:55,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {393#(<= main_~a~0 2)} is VALID [2022-04-28 04:06:55,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {393#(<= main_~a~0 2)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-28 04:06:55,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-28 04:06:55,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-28 04:06:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:55,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481721130] [2022-04-28 04:06:55,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481721130] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:55,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866114702] [2022-04-28 04:06:55,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:06:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:55,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:06:55,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:06:55,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:06:55,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:06:55,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 04:06:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:55,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:06:55,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2022-04-28 04:06:55,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {386#true} is VALID [2022-04-28 04:06:55,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-28 04:06:55,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-28 04:06:55,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-28 04:06:55,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {413#(<= main_~a~0 0)} is VALID [2022-04-28 04:06:55,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {413#(<= main_~a~0 0)} assume !!(~a~0 < 6); {413#(<= main_~a~0 0)} is VALID [2022-04-28 04:06:55,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {392#(<= main_~a~0 1)} is VALID [2022-04-28 04:06:55,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#(<= main_~a~0 1)} assume !!(~a~0 < 6); {392#(<= main_~a~0 1)} is VALID [2022-04-28 04:06:55,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {393#(<= main_~a~0 2)} is VALID [2022-04-28 04:06:55,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {393#(<= main_~a~0 2)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-28 04:06:55,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-28 04:06:55,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-28 04:06:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:55,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:06:55,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-28 04:06:55,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-28 04:06:55,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#(< main_~a~0 6)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-28 04:06:55,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {445#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {441#(< main_~a~0 6)} is VALID [2022-04-28 04:06:55,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#(< main_~a~0 5)} assume !!(~a~0 < 6); {445#(< main_~a~0 5)} is VALID [2022-04-28 04:06:55,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {445#(< main_~a~0 5)} is VALID [2022-04-28 04:06:55,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(< main_~a~0 4)} assume !!(~a~0 < 6); {452#(< main_~a~0 4)} is VALID [2022-04-28 04:06:55,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {452#(< main_~a~0 4)} is VALID [2022-04-28 04:06:55,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-28 04:06:55,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-28 04:06:55,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-28 04:06:55,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {386#true} is VALID [2022-04-28 04:06:55,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2022-04-28 04:06:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:55,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866114702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:06:55,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:06:55,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 04:06:55,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:55,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777238663] [2022-04-28 04:06:55,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777238663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:55,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:55,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:06:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493389666] [2022-04-28 04:06:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:55,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2022-04-28 04:06:55,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:55,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 04:06:55,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:55,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:06:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:55,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:06:55,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:06:55,387 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 04:06:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:55,475 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 04:06:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:06:55,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2022-04-28 04:06:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 04:06:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 04:06:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 04:06:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 04:06:55,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 04:06:55,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:55,497 INFO L225 Difference]: With dead ends: 20 [2022-04-28 04:06:55,498 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 04:06:55,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:06:55,499 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:06:55,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:06:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 04:06:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 04:06:55,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:55,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-28 04:06:55,505 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-28 04:06:55,505 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-28 04:06:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:55,507 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 04:06:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 04:06:55,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:55,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:55,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 17 states. [2022-04-28 04:06:55,507 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 17 states. [2022-04-28 04:06:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:55,508 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 04:06:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 04:06:55,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:55,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:55,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:55,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-28 04:06:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 04:06:55,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-28 04:06:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:55,510 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 04:06:55,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 04:06:55,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 04:06:55,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 04:06:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:06:55,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:55,525 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:55,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:06:55,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 04:06:55,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash -177482015, now seen corresponding path program 5 times [2022-04-28 04:06:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:55,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002651487] [2022-04-28 04:06:59,824 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:06:59,885 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:06:59,886 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:06:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1602389863, now seen corresponding path program 1 times [2022-04-28 04:06:59,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:59,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464988738] [2022-04-28 04:06:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:06:59,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 04:06:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:06:59,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 04:06:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -177482015, now seen corresponding path program 6 times [2022-04-28 04:06:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:59,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567372234] [2022-04-28 04:06:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:59,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:59,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:59,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#(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(12, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-28 04:06:59,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-28 04:06:59,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-28 04:06:59,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:59,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#(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(12, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-28 04:06:59,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-28 04:06:59,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-28 04:06:59,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-28 04:06:59,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {593#(= main_~a~0 0)} is VALID [2022-04-28 04:06:59,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {593#(= main_~a~0 0)} assume !!(~a~0 < 6); {593#(= main_~a~0 0)} is VALID [2022-04-28 04:06:59,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {593#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {594#(<= main_~a~0 1)} is VALID [2022-04-28 04:06:59,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#(<= main_~a~0 1)} assume !!(~a~0 < 6); {594#(<= main_~a~0 1)} is VALID [2022-04-28 04:06:59,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {595#(<= main_~a~0 2)} is VALID [2022-04-28 04:06:59,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-28 04:06:59,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {596#(<= main_~a~0 3)} is VALID [2022-04-28 04:06:59,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~a~0 3)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-28 04:06:59,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-28 04:06:59,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-28 04:06:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:06:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567372234] [2022-04-28 04:06:59,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567372234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:06:59,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372122623] [2022-04-28 04:06:59,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:06:59,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:06:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:59,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:07:00,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:07:00,039 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 04:07:00,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:07:00,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:07:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:00,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:07:00,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2022-04-28 04:07:00,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-28 04:07:00,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-28 04:07:00,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-28 04:07:00,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-28 04:07:00,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {616#(<= main_~a~0 0)} is VALID [2022-04-28 04:07:00,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#(<= main_~a~0 0)} assume !!(~a~0 < 6); {616#(<= main_~a~0 0)} is VALID [2022-04-28 04:07:00,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {594#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:00,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#(<= main_~a~0 1)} assume !!(~a~0 < 6); {594#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:00,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {595#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:00,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:00,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {596#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:00,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~a~0 3)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-28 04:07:00,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-28 04:07:00,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-28 04:07:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:00,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:07:00,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-28 04:07:00,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-28 04:07:00,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#(< main_~a~0 6)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-28 04:07:00,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {654#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {650#(< main_~a~0 6)} is VALID [2022-04-28 04:07:00,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(< main_~a~0 5)} assume !!(~a~0 < 6); {654#(< main_~a~0 5)} is VALID [2022-04-28 04:07:00,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {654#(< main_~a~0 5)} is VALID [2022-04-28 04:07:00,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#(<= main_~a~0 3)} assume !!(~a~0 < 6); {596#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:00,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {596#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:00,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:00,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {595#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:00,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-28 04:07:00,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-28 04:07:00,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-28 04:07:00,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-28 04:07:00,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2022-04-28 04:07:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:00,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372122623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:07:00,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:07:00,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 04:07:00,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:00,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002651487] [2022-04-28 04:07:00,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002651487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:00,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:00,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:07:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657150654] [2022-04-28 04:07:00,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-28 04:07:00,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:00,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-28 04:07:00,282 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-28 04:07:00,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:07:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:07:00,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:07:00,284 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-28 04:07:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:00,388 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:07:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:07:00,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-28 04:07:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-28 04:07:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-28 04:07:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-28 04:07:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-28 04:07:00,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2022-04-28 04:07:00,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:00,412 INFO L225 Difference]: With dead ends: 22 [2022-04-28 04:07:00,412 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 04:07:00,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:07:00,413 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:00,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 04:07:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 04:07:00,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:00,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 04:07:00,423 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 04:07:00,423 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 04:07:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:00,425 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 04:07:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 04:07:00,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:00,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:00,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 04:07:00,425 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 04:07:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:00,426 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 04:07:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 04:07:00,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:00,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:00,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:00,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 04:07:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 04:07:00,428 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-28 04:07:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:00,428 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 04:07:00,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-28 04:07:00,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 04:07:00,443 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-28 04:07:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 04:07:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:07:00,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:00,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:00,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 04:07:00,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:07:00,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1240133887, now seen corresponding path program 7 times [2022-04-28 04:07:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:00,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044643425] [2022-04-28 04:07:04,751 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:04,835 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:04,837 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1602451367, now seen corresponding path program 1 times [2022-04-28 04:07:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:04,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445654543] [2022-04-28 04:07:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:07:04,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 04:07:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:07:04,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 04:07:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1240133887, now seen corresponding path program 8 times [2022-04-28 04:07:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:04,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674758042] [2022-04-28 04:07:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:04,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {826#(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(12, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-04-28 04:07:04,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-28 04:07:04,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-28 04:07:04,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:04,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#(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(12, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-04-28 04:07:04,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-28 04:07:04,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-28 04:07:04,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-28 04:07:04,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {821#(= main_~a~0 0)} is VALID [2022-04-28 04:07:04,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {821#(= main_~a~0 0)} assume !!(~a~0 < 6); {821#(= main_~a~0 0)} is VALID [2022-04-28 04:07:04,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {821#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {822#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:04,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:04,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {823#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:04,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:04,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {824#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:04,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:04,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {825#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:04,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#(<= main_~a~0 4)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-28 04:07:04,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-28 04:07:04,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-28 04:07:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:04,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674758042] [2022-04-28 04:07:04,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674758042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:07:04,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460486604] [2022-04-28 04:07:04,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:07:04,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:07:04,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:07:04,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:07:04,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 04:07:04,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:07:04,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:07:04,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 04:07:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:04,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:07:05,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2022-04-28 04:07:05,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-04-28 04:07:05,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-28 04:07:05,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-28 04:07:05,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-28 04:07:05,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {845#(<= main_~a~0 0)} is VALID [2022-04-28 04:07:05,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#(<= main_~a~0 0)} assume !!(~a~0 < 6); {845#(<= main_~a~0 0)} is VALID [2022-04-28 04:07:05,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {822#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:05,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:05,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {823#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:05,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:05,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {824#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:05,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:05,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {825#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:05,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#(<= main_~a~0 4)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-28 04:07:05,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-28 04:07:05,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-28 04:07:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:05,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:07:05,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-28 04:07:05,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-28 04:07:05,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#(< main_~a~0 6)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-28 04:07:05,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {825#(<= main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {885#(< main_~a~0 6)} is VALID [2022-04-28 04:07:05,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {825#(<= main_~a~0 4)} assume !!(~a~0 < 6); {825#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:05,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {824#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {825#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:05,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:05,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {824#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:05,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:05,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {823#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:05,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:05,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {822#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:05,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-28 04:07:05,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-28 04:07:05,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-28 04:07:05,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-04-28 04:07:05,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2022-04-28 04:07:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:05,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460486604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:07:05,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:07:05,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 04:07:05,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:05,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044643425] [2022-04-28 04:07:05,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044643425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:05,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:05,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:07:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589915209] [2022-04-28 04:07:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:05,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 17 [2022-04-28 04:07:05,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:05,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 04:07:05,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:05,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:07:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:07:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:07:05,192 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 04:07:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:05,318 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 04:07:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:07:05,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 17 [2022-04-28 04:07:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 04:07:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-28 04:07:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 04:07:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-28 04:07:05,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-04-28 04:07:05,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:05,343 INFO L225 Difference]: With dead ends: 24 [2022-04-28 04:07:05,343 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 04:07:05,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:07:05,344 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:05,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 04:07:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 04:07:05,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:05,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-28 04:07:05,357 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-28 04:07:05,357 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-28 04:07:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:05,358 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 04:07:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 04:07:05,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:05,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:05,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 21 states. [2022-04-28 04:07:05,359 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 21 states. [2022-04-28 04:07:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:05,360 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 04:07:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 04:07:05,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:05,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:05,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:05,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-28 04:07:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 04:07:05,361 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2022-04-28 04:07:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:05,361 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 04:07:05,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 04:07:05,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 04:07:05,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 04:07:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 04:07:05,392 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:05,392 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:05,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 04:07:05,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:07:05,604 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2064382877, now seen corresponding path program 9 times [2022-04-28 04:07:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:05,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621747902] [2022-04-28 04:07:09,695 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:09,764 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:09,765 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1602512871, now seen corresponding path program 1 times [2022-04-28 04:07:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:09,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340810817] [2022-04-28 04:07:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:07:09,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 04:07:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:07:09,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 04:07:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2064382877, now seen corresponding path program 10 times [2022-04-28 04:07:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:09,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132339144] [2022-04-28 04:07:09,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:09,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:09,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(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(12, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-28 04:07:09,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-28 04:07:09,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-28 04:07:09,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:09,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(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(12, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-28 04:07:09,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-28 04:07:09,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-28 04:07:09,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-28 04:07:09,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1075#(= main_~a~0 0)} is VALID [2022-04-28 04:07:09,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(= main_~a~0 0)} assume !!(~a~0 < 6); {1075#(= main_~a~0 0)} is VALID [2022-04-28 04:07:09,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {1075#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1076#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:09,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:09,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1077#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:09,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:09,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1078#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:09,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:09,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {1078#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1079#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:09,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:09,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {1079#(<= main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1080#(<= main_~a~0 5)} is VALID [2022-04-28 04:07:09,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-28 04:07:09,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-28 04:07:09,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-28 04:07:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:09,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132339144] [2022-04-28 04:07:09,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132339144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:07:09,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612763348] [2022-04-28 04:07:09,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:07:09,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:07:09,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:07:09,852 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:07:09,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 04:07:09,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:07:09,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:07:09,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:07:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:09,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:07:10,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-28 04:07:10,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-28 04:07:10,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-28 04:07:10,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-28 04:07:10,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-28 04:07:10,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1100#(<= main_~a~0 0)} is VALID [2022-04-28 04:07:10,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {1100#(<= main_~a~0 0)} assume !!(~a~0 < 6); {1100#(<= main_~a~0 0)} is VALID [2022-04-28 04:07:10,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1100#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1076#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:10,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:10,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1077#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:10,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:10,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1078#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:10,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:10,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {1078#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1079#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:10,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:10,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {1079#(<= main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1080#(<= main_~a~0 5)} is VALID [2022-04-28 04:07:10,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-28 04:07:10,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-28 04:07:10,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-28 04:07:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:10,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:07:10,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-28 04:07:10,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-28 04:07:10,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-28 04:07:10,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {1079#(<= main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1080#(<= main_~a~0 5)} is VALID [2022-04-28 04:07:10,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:10,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {1078#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1079#(<= main_~a~0 4)} is VALID [2022-04-28 04:07:10,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:10,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1078#(<= main_~a~0 3)} is VALID [2022-04-28 04:07:10,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:10,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1077#(<= main_~a~0 2)} is VALID [2022-04-28 04:07:10,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:10,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {1100#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1076#(<= main_~a~0 1)} is VALID [2022-04-28 04:07:10,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {1100#(<= main_~a~0 0)} assume !!(~a~0 < 6); {1100#(<= main_~a~0 0)} is VALID [2022-04-28 04:07:10,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1100#(<= main_~a~0 0)} is VALID [2022-04-28 04:07:10,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-28 04:07:10,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-28 04:07:10,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-28 04:07:10,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-28 04:07:10,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-28 04:07:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:10,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612763348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:07:10,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:07:10,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-28 04:07:10,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:10,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621747902] [2022-04-28 04:07:10,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621747902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:10,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:10,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:07:10,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279036427] [2022-04-28 04:07:10,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:10,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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 19 [2022-04-28 04:07:10,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:10,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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-28 04:07:10,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:10,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:07:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:07:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:07:10,188 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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-28 04:07:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:10,310 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 04:07:10,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:07:10,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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 19 [2022-04-28 04:07:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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-28 04:07:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2022-04-28 04:07:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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-28 04:07:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2022-04-28 04:07:10,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 25 transitions. [2022-04-28 04:07:10,340 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-28 04:07:10,342 INFO L225 Difference]: With dead ends: 25 [2022-04-28 04:07:10,342 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 04:07:10,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:07:10,343 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:10,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 04:07:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 04:07:10,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:10,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 04:07:10,358 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 04:07:10,358 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 04:07:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:10,359 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:07:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 04:07:10,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:10,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:10,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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 22 states. [2022-04-28 04:07:10,361 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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 22 states. [2022-04-28 04:07:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:10,363 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 04:07:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 04:07:10,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:10,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:10,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:10,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 04:07:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 04:07:10,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2022-04-28 04:07:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:10,367 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 04:07:10,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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-28 04:07:10,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 04:07:10,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 04:07:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:07:10,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:10,386 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:10,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 04:07:10,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2022-04-28 04:07:10,607 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -401287493, now seen corresponding path program 11 times [2022-04-28 04:07:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:10,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1352080709] [2022-04-28 04:07:14,690 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:14,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:14,776 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1602574375, now seen corresponding path program 1 times [2022-04-28 04:07:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:14,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525975471] [2022-04-28 04:07:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:07:14,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 04:07:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:07:14,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 04:07:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash -401287493, now seen corresponding path program 12 times [2022-04-28 04:07:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:14,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141598892] [2022-04-28 04:07:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:07:14,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 04:07:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:07:14,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 04:07:14,821 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 04:07:14,821 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 04:07:14,823 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:07:14,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2022-04-28 04:07:14,826 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:14,842 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:07:14,851 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-28 04:07:14,852 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 04:07:14,853 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 04:07:14,853 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:07:14,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:07:14 BoogieIcfgContainer [2022-04-28 04:07:14,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:07:14,862 INFO L158 Benchmark]: Toolchain (without parser) took 30214.61ms. Allocated memory was 183.5MB in the beginning and 253.8MB in the end (delta: 70.3MB). Free memory was 133.7MB in the beginning and 97.7MB in the end (delta: 36.0MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. [2022-04-28 04:07:14,862 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:07:14,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.45ms. Allocated memory is still 183.5MB. Free memory was 133.4MB in the beginning and 160.1MB in the end (delta: -26.7MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-28 04:07:14,863 INFO L158 Benchmark]: Boogie Preprocessor took 24.85ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 158.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 04:07:14,863 INFO L158 Benchmark]: RCFGBuilder took 182.41ms. Allocated memory is still 183.5MB. Free memory was 158.9MB in the beginning and 149.0MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 04:07:14,863 INFO L158 Benchmark]: TraceAbstraction took 29804.07ms. Allocated memory was 183.5MB in the beginning and 253.8MB in the end (delta: 70.3MB). Free memory was 148.6MB in the beginning and 97.7MB in the end (delta: 50.9MB). Peak memory consumption was 122.1MB. Max. memory is 8.0GB. [2022-04-28 04:07:14,864 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.45ms. Allocated memory is still 183.5MB. Free memory was 133.4MB in the beginning and 160.1MB in the end (delta: -26.7MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.85ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 158.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 182.41ms. Allocated memory is still 183.5MB. Free memory was 158.9MB in the beginning and 149.0MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 29804.07ms. Allocated memory was 183.5MB in the beginning and 253.8MB in the end (delta: 70.3MB). Free memory was 148.6MB in the beginning and 97.7MB in the end (delta: 50.9MB). Peak memory consumption was 122.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int a = 6; [L19] a = 0 [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND FALSE !(a < 6) [L22] COND TRUE a == 6 [L23] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 70 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 04:07:14,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...