/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_1b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:32:26,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:32:26,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:32:26,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:32:26,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:32:26,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:32:26,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:32:26,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:32:26,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:32:26,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:32:26,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:32:26,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:32:26,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:32:26,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:32:26,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:32:26,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:32:26,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:32:26,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:32:26,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:32:26,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:32:26,212 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:32:26,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:32:26,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:32:26,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:32:26,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:32:26,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:32:26,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:32:26,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:32:26,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:32:26,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:32:26,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:32:26,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:32:26,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:32:26,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:32:26,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:32:26,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:32:26,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:32:26,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:32:26,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:32:26,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:32:26,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:32:26,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:32:26,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:32:26,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:32:26,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:32:26,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:32:26,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:32:26,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:32:26,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:32:26,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:32:26,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:32:26,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:32:26,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:32:26,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:32:26,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:32:26,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:32:26,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:32:26,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:32:26,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:32:26,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:32:26,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:32:26,236 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:32:26,237 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:32:26,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:32:26,237 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:32:26,237 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:32:26,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:32:26,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:32:26,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:32:26,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:32:26,431 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:32:26,432 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-08 10:32:26,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eea089d0/80ef6dab64054a7cab61fead1a6f3dfb/FLAG911de6a3f [2022-04-08 10:32:26,810 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:32:26,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1b.c [2022-04-08 10:32:26,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eea089d0/80ef6dab64054a7cab61fead1a6f3dfb/FLAG911de6a3f [2022-04-08 10:32:27,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eea089d0/80ef6dab64054a7cab61fead1a6f3dfb [2022-04-08 10:32:27,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:32:27,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:32:27,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:32:27,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:32:27,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:32:27,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549abf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27, skipping insertion in model container [2022-04-08 10:32:27,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:32:27,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:32:27,397 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-08 10:32:27,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:32:27,405 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:32:27,412 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-08 10:32:27,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:32:27,424 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:32:27,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27 WrapperNode [2022-04-08 10:32:27,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:32:27,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:32:27,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:32:27,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:32:27,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:32:27,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:32:27,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:32:27,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:32:27,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (1/1) ... [2022-04-08 10:32:27,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:32:27,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:27,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 10:32:27,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 10:32:27,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:32:27,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:32:27,509 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:32:27,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:32:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:32:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:32:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:32:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:32:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:32:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:32:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:32:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:32:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:32:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:32:27,553 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:32:27,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:32:27,614 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:32:27,618 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:32:27,618 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:32:27,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:32:27 BoogieIcfgContainer [2022-04-08 10:32:27,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:32:27,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:32:27,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:32:27,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:32:27,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:32:27" (1/3) ... [2022-04-08 10:32:27,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acb9610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:32:27, skipping insertion in model container [2022-04-08 10:32:27,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:32:27" (2/3) ... [2022-04-08 10:32:27,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acb9610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:32:27, skipping insertion in model container [2022-04-08 10:32:27,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:32:27" (3/3) ... [2022-04-08 10:32:27,639 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1b.c [2022-04-08 10:32:27,643 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:32:27,643 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:32:27,668 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:32:27,676 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:32:27,676 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:32:27,691 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-08 10:32:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 10:32:27,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:27,697 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:27,697 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:27,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:27,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 1 times [2022-04-08 10:32:27,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:27,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075141082] [2022-04-08 10:32:27,712 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:32:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 2 times [2022-04-08 10:32:27,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:27,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406569269] [2022-04-08 10:32:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:27,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:27,838 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-08 10:32:27,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-08 10:32:27,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-08 10:32:27,840 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-08 10:32:27,840 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-08 10:32:27,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-08 10:32:27,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-08 10:32:27,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret5 := main(); {19#true} is VALID [2022-04-08 10:32:27,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} ~a~0 := 6;~a~0 := 0; {19#true} is VALID [2022-04-08 10:32:27,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-04-08 10:32:27,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume 6 == ~a~0; {20#false} is VALID [2022-04-08 10:32:27,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-04-08 10:32:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:32:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:27,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406569269] [2022-04-08 10:32:27,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406569269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:27,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:27,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:32:27,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:27,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1075141082] [2022-04-08 10:32:27,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1075141082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:27,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:27,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:32:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223752823] [2022-04-08 10:32:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:27,850 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-08 10:32:27,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:27,853 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-08 10:32:27,864 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-08 10:32:27,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:32:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:32:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:32:27,880 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-08 10:32:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:27,917 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 10:32:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:32:27,917 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-08 10:32:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:27,918 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-08 10:32:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-08 10:32:27,924 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-08 10:32:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-08 10:32:27,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-08 10:32:27,952 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-08 10:32:27,957 INFO L225 Difference]: With dead ends: 24 [2022-04-08 10:32:27,957 INFO L226 Difference]: Without dead ends: 11 [2022-04-08 10:32:27,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:32:27,961 INFO L913 BasicCegarLoop]: 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-08 10:32:27,962 INFO L914 BasicCegarLoop]: 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-08 10:32:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-04-08 10:32:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-04-08 10:32:27,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:27,980 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-08 10:32:27,980 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-08 10:32:27,981 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-08 10:32:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:27,982 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-08 10:32:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-08 10:32:27,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:27,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:27,983 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-08 10:32:27,983 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-08 10:32:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:27,985 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-08 10:32:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-08 10:32:27,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:27,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:27,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:27,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:27,986 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-08 10:32:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-04-08 10:32:27,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-04-08 10:32:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:27,988 INFO L478 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-04-08 10:32:27,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:27,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 11 transitions. [2022-04-08 10:32:27,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-08 10:32:27,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 10:32:28,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:28,000 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:28,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:32:28,000 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 1 times [2022-04-08 10:32:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:28,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [919488025] [2022-04-08 10:32:28,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:32:28,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 2 times [2022-04-08 10:32:28,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:28,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6708706] [2022-04-08 10:32:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:28,071 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-08 10:32:28,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume true; {119#true} is VALID [2022-04-08 10:32:28,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} #32#return; {119#true} is VALID [2022-04-08 10:32:28,073 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-08 10:32:28,073 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-08 10:32:28,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#true} assume true; {119#true} is VALID [2022-04-08 10:32:28,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119#true} {119#true} #32#return; {119#true} is VALID [2022-04-08 10:32:28,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {119#true} call #t~ret5 := main(); {119#true} is VALID [2022-04-08 10:32:28,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#true} ~a~0 := 6;~a~0 := 0; {124#(= main_~a~0 0)} is VALID [2022-04-08 10:32:28,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#(= main_~a~0 0)} assume !(~a~0 < 6); {120#false} is VALID [2022-04-08 10:32:28,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#false} assume 6 == ~a~0; {120#false} is VALID [2022-04-08 10:32:28,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-04-08 10:32:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:32:28,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:28,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6708706] [2022-04-08 10:32:28,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6708706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:28,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:28,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:32:28,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [919488025] [2022-04-08 10:32:28,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [919488025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:28,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:28,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:32:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495329854] [2022-04-08 10:32:28,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:28,078 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-08 10:32:28,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:28,078 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-08 10:32:28,089 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-08 10:32:28,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:32:28,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:32:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:32:28,091 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-08 10:32:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:28,138 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 10:32:28,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:32:28,138 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-08 10:32:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:28,138 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-08 10:32:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-08 10:32:28,139 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-08 10:32:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-08 10:32:28,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2022-04-08 10:32:28,157 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-08 10:32:28,159 INFO L225 Difference]: With dead ends: 16 [2022-04-08 10:32:28,159 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 10:32:28,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:32:28,161 INFO L913 BasicCegarLoop]: 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-08 10:32:28,161 INFO L914 BasicCegarLoop]: 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-08 10:32:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 10:32:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-04-08 10:32:28,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:28,164 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-08 10:32:28,165 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-08 10:32:28,165 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-08 10:32:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:28,166 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 10:32:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 10:32:28,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:28,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:28,167 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-08 10:32:28,167 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-08 10:32:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:28,168 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 10:32:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 10:32:28,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:28,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:28,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:28,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:28,169 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-08 10:32:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-08 10:32:28,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-04-08 10:32:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:28,170 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-08 10:32:28,170 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:28,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-08 10:32:28,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 10:32:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 10:32:28,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:28,185 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:28,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:32:28,186 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:28,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1889274843, now seen corresponding path program 1 times [2022-04-08 10:32:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:28,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951581249] [2022-04-08 10:32:28,200 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:28,200 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1889274843, now seen corresponding path program 2 times [2022-04-08 10:32:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:28,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389839461] [2022-04-08 10:32:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:28,264 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-08 10:32:28,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-08 10:32:28,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-08 10:32:28,265 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-08 10:32:28,265 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-08 10:32:28,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-08 10:32:28,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-08 10:32:28,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-08 10:32:28,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {217#(= main_~a~0 0)} is VALID [2022-04-08 10:32:28,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~a~0 0)} assume !!(~a~0 < 6); {217#(= main_~a~0 0)} is VALID [2022-04-08 10:32:28,267 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-08 10:32:28,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(<= main_~a~0 1)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-08 10:32:28,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-08 10:32:28,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-08 10:32:28,268 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-08 10:32:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:28,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389839461] [2022-04-08 10:32:28,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389839461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:28,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570314010] [2022-04-08 10:32:28,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:32:28,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:28,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:28,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:28,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:32:28,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:32:28,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:28,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 10:32:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:28,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:28,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-08 10:32:28,413 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-08 10:32:28,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-08 10:32:28,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-08 10:32:28,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-08 10:32:28,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {238#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:28,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#(<= main_~a~0 0)} assume !!(~a~0 < 6); {238#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:28,415 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-08 10:32:28,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(<= main_~a~0 1)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-08 10:32:28,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-08 10:32:28,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-08 10:32:28,419 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-08 10:32:28,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:28,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-08 10:32:28,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-08 10:32:28,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(< main_~a~0 6)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-08 10:32:28,497 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-08 10:32:28,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {264#(< main_~a~0 5)} assume !!(~a~0 < 6); {264#(< main_~a~0 5)} is VALID [2022-04-08 10:32:28,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {264#(< main_~a~0 5)} is VALID [2022-04-08 10:32:28,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-08 10:32:28,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-08 10:32:28,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-08 10:32:28,500 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-08 10:32:28,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-08 10:32:28,500 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-08 10:32:28,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570314010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:28,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:28,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 10:32:28,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:28,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951581249] [2022-04-08 10:32:28,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951581249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:28,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:28,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:32:28,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609019999] [2022-04-08 10:32:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:28,502 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-08 10:32:28,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:28,503 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-08 10:32:28,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:28,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:32:28,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:28,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:32:28,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:32:28,511 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-08 10:32:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:28,554 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 10:32:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:32:28,554 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-08 10:32:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:28,555 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-08 10:32:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-08 10:32:28,556 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-08 10:32:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-08 10:32:28,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-04-08 10:32:28,584 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-08 10:32:28,585 INFO L225 Difference]: With dead ends: 18 [2022-04-08 10:32:28,585 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 10:32:28,585 INFO L912 BasicCegarLoop]: 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-08 10:32:28,586 INFO L913 BasicCegarLoop]: 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-08 10:32:28,587 INFO L914 BasicCegarLoop]: 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-08 10:32:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 10:32:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-08 10:32:28,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:28,590 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-08 10:32:28,590 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-08 10:32:28,590 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-08 10:32:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:28,591 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:32:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:32:28,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:28,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:28,592 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-08 10:32:28,592 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-08 10:32:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:28,593 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:32:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:32:28,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:28,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:28,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:28,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:28,593 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-08 10:32:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 10:32:28,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-08 10:32:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:28,594 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 10:32:28,594 INFO L479 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-08 10:32:28,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 10:32:28,605 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-08 10:32:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 10:32:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 10:32:28,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:28,605 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:28,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:32:28,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:28,809 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:28,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1179700547, now seen corresponding path program 3 times [2022-04-08 10:32:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:28,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1339834511] [2022-04-08 10:32:28,816 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:28,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1179700547, now seen corresponding path program 4 times [2022-04-08 10:32:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:28,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993511361] [2022-04-08 10:32:28,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:28,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:28,886 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-08 10:32:28,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-08 10:32:28,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-08 10:32:28,887 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-08 10:32:28,887 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-08 10:32:28,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-08 10:32:28,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-08 10:32:28,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-08 10:32:28,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {391#(= main_~a~0 0)} is VALID [2022-04-08 10:32:28,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {391#(= main_~a~0 0)} assume !!(~a~0 < 6); {391#(= main_~a~0 0)} is VALID [2022-04-08 10:32:28,890 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-08 10:32:28,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#(<= main_~a~0 1)} assume !!(~a~0 < 6); {392#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:28,893 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-08 10:32:28,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {393#(<= main_~a~0 2)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-08 10:32:28,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-08 10:32:28,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-08 10:32:28,898 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-08 10:32:28,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:28,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993511361] [2022-04-08 10:32:28,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993511361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:28,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262573587] [2022-04-08 10:32:28,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:32:28,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:28,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:28,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:28,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:32:28,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:32:28,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:28,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 10:32:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:28,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:28,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2022-04-08 10:32:28,998 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-08 10:32:28,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-08 10:32:28,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-08 10:32:28,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-08 10:32:29,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {413#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:29,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {413#(<= main_~a~0 0)} assume !!(~a~0 < 6); {413#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:29,000 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-08 10:32:29,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#(<= main_~a~0 1)} assume !!(~a~0 < 6); {392#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:29,001 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-08 10:32:29,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {393#(<= main_~a~0 2)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-08 10:32:29,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-08 10:32:29,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-08 10:32:29,002 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-08 10:32:29,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:29,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-08 10:32:29,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-08 10:32:29,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#(< main_~a~0 6)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-08 10:32:29,091 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-08 10:32:29,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#(< main_~a~0 5)} assume !!(~a~0 < 6); {445#(< main_~a~0 5)} is VALID [2022-04-08 10:32:29,092 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-08 10:32:29,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(< main_~a~0 4)} assume !!(~a~0 < 6); {452#(< main_~a~0 4)} is VALID [2022-04-08 10:32:29,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {452#(< main_~a~0 4)} is VALID [2022-04-08 10:32:29,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-08 10:32:29,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-08 10:32:29,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-08 10:32:29,093 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-08 10:32:29,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2022-04-08 10:32:29,094 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-08 10:32:29,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262573587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:29,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:29,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 10:32:29,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:29,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1339834511] [2022-04-08 10:32:29,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1339834511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:29,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:29,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:32:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388693846] [2022-04-08 10:32:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:29,095 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-08 10:32:29,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:29,095 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-08 10:32:29,109 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-08 10:32:29,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:32:29,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:29,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:32:29,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:29,110 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-08 10:32:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,184 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 10:32:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:32:29,184 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-08 10:32:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:29,184 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-08 10:32:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 10:32:29,185 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-08 10:32:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 10:32:29,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-08 10:32:29,202 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-08 10:32:29,203 INFO L225 Difference]: With dead ends: 20 [2022-04-08 10:32:29,203 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:32:29,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:32:29,204 INFO L913 BasicCegarLoop]: 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-08 10:32:29,204 INFO L914 BasicCegarLoop]: 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-08 10:32:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:32:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-08 10:32:29,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:29,211 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-08 10:32:29,211 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-08 10:32:29,211 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-08 10:32:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,212 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 10:32:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 10:32:29,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:29,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:29,213 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-08 10:32:29,213 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-08 10:32:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,214 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 10:32:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 10:32:29,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:29,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:29,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:29,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:29,214 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-08 10:32:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 10:32:29,215 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-08 10:32:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:29,215 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 10:32:29,215 INFO L479 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-08 10:32:29,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 10:32:29,228 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-08 10:32:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 10:32:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:32:29,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:29,228 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:29,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:32:29,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 10:32:29,444 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash -177482015, now seen corresponding path program 5 times [2022-04-08 10:32:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:29,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425524122] [2022-04-08 10:32:29,448 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:29,448 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash -177482015, now seen corresponding path program 6 times [2022-04-08 10:32:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:29,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267218677] [2022-04-08 10:32:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:29,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:29,508 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-08 10:32:29,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-08 10:32:29,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-08 10:32:29,510 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-08 10:32:29,510 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-08 10:32:29,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-08 10:32:29,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-08 10:32:29,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-08 10:32:29,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {593#(= main_~a~0 0)} is VALID [2022-04-08 10:32:29,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {593#(= main_~a~0 0)} assume !!(~a~0 < 6); {593#(= main_~a~0 0)} is VALID [2022-04-08 10:32:29,512 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-08 10:32:29,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#(<= main_~a~0 1)} assume !!(~a~0 < 6); {594#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:29,513 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-08 10:32:29,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:29,514 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-08 10:32:29,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~a~0 3)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-08 10:32:29,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-08 10:32:29,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-08 10:32:29,515 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-08 10:32:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267218677] [2022-04-08 10:32:29,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267218677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830413823] [2022-04-08 10:32:29,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:32:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:29,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:29,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 10:32:29,555 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:32:29,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:29,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 10:32:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:29,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:29,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2022-04-08 10:32:29,646 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-08 10:32:29,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-08 10:32:29,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-08 10:32:29,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-08 10:32:29,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {616#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:29,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#(<= main_~a~0 0)} assume !!(~a~0 < 6); {616#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:29,656 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-08 10:32:29,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#(<= main_~a~0 1)} assume !!(~a~0 < 6); {594#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:29,656 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-08 10:32:29,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:29,657 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-08 10:32:29,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~a~0 3)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-08 10:32:29,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-08 10:32:29,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-08 10:32:29,658 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-08 10:32:29,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:29,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-08 10:32:29,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-08 10:32:29,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#(< main_~a~0 6)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-08 10:32:29,736 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-08 10:32:29,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(< main_~a~0 5)} assume !!(~a~0 < 6); {654#(< main_~a~0 5)} is VALID [2022-04-08 10:32:29,737 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-08 10:32:29,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#(<= main_~a~0 3)} assume !!(~a~0 < 6); {596#(<= main_~a~0 3)} is VALID [2022-04-08 10:32:29,738 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-08 10:32:29,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:29,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {595#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:29,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-08 10:32:29,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-08 10:32:29,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-08 10:32:29,739 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-08 10:32:29,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2022-04-08 10:32:29,739 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-08 10:32:29,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830413823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:29,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:29,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-08 10:32:29,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:29,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425524122] [2022-04-08 10:32:29,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425524122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:29,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:29,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:32:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793971312] [2022-04-08 10:32:29,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:29,740 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-08 10:32:29,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:29,741 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-08 10:32:29,749 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-08 10:32:29,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:32:29,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:32:29,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:29,750 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-08 10:32:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,836 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:32:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:32:29,837 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-08 10:32:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:29,837 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-08 10:32:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-08 10:32:29,838 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-08 10:32:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-08 10:32:29,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2022-04-08 10:32:29,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:29,856 INFO L225 Difference]: With dead ends: 22 [2022-04-08 10:32:29,856 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 10:32:29,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:32:29,857 INFO L913 BasicCegarLoop]: 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-08 10:32:29,858 INFO L914 BasicCegarLoop]: 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-08 10:32:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 10:32:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 10:32:29,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:29,865 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-08 10:32:29,865 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-08 10:32:29,865 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-08 10:32:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,866 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 10:32:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 10:32:29,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:29,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:29,867 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-08 10:32:29,867 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-08 10:32:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,868 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 10:32:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 10:32:29,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:29,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:29,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:29,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:29,868 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-08 10:32:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 10:32:29,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-08 10:32:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:29,869 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 10:32:29,869 INFO L479 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-08 10:32:29,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 10:32:29,882 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-08 10:32:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 10:32:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:32:29,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:29,882 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:29,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 10:32:30,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:30,094 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1240133887, now seen corresponding path program 7 times [2022-04-08 10:32:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:30,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025549551] [2022-04-08 10:32:30,096 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:30,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1240133887, now seen corresponding path program 8 times [2022-04-08 10:32:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:30,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617735076] [2022-04-08 10:32:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:30,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:30,158 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-08 10:32:30,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-08 10:32:30,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-08 10:32:30,159 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-08 10:32:30,159 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-08 10:32:30,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-08 10:32:30,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-08 10:32:30,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-08 10:32:30,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {821#(= main_~a~0 0)} is VALID [2022-04-08 10:32:30,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {821#(= main_~a~0 0)} assume !!(~a~0 < 6); {821#(= main_~a~0 0)} is VALID [2022-04-08 10:32:30,160 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-08 10:32:30,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:30,161 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-08 10:32:30,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:30,162 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-08 10:32:30,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-08 10:32:30,162 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-08 10:32:30,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#(<= main_~a~0 4)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-08 10:32:30,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-08 10:32:30,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-08 10:32:30,163 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-08 10:32:30,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:30,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617735076] [2022-04-08 10:32:30,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617735076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:30,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208007393] [2022-04-08 10:32:30,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:32:30,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:30,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:30,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:30,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 10:32:30,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:32:30,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:30,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 10:32:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:30,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:30,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2022-04-08 10:32:30,279 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-08 10:32:30,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-08 10:32:30,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-08 10:32:30,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-08 10:32:30,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {845#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:30,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#(<= main_~a~0 0)} assume !!(~a~0 < 6); {845#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:30,280 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-08 10:32:30,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:30,281 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-08 10:32:30,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:30,285 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-08 10:32:30,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-08 10:32:30,286 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-08 10:32:30,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#(<= main_~a~0 4)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-08 10:32:30,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-08 10:32:30,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-08 10:32:30,287 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-08 10:32:30,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:30,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-08 10:32:30,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-08 10:32:30,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#(< main_~a~0 6)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-08 10:32:30,390 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-08 10:32:30,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {825#(<= main_~a~0 4)} assume !!(~a~0 < 6); {825#(<= main_~a~0 4)} is VALID [2022-04-08 10:32:30,391 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-08 10:32:30,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-08 10:32:30,392 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-08 10:32:30,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:30,393 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-08 10:32:30,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:30,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {822#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:30,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-08 10:32:30,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-08 10:32:30,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-08 10:32:30,394 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-08 10:32:30,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2022-04-08 10:32:30,394 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-08 10:32:30,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208007393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:30,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:30,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-08 10:32:30,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025549551] [2022-04-08 10:32:30,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025549551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:30,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:30,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:32:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114628866] [2022-04-08 10:32:30,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:30,395 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-08 10:32:30,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:30,395 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-08 10:32:30,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:30,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:32:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:32:30,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:30,411 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-08 10:32:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:30,521 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 10:32:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:32:30,522 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-08 10:32:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:30,522 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-08 10:32:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-08 10:32:30,523 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-08 10:32:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-08 10:32:30,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-04-08 10:32:30,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:30,546 INFO L225 Difference]: With dead ends: 24 [2022-04-08 10:32:30,546 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 10:32:30,546 INFO L912 BasicCegarLoop]: 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-08 10:32:30,546 INFO L913 BasicCegarLoop]: 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-08 10:32:30,547 INFO L914 BasicCegarLoop]: 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-08 10:32:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 10:32:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-08 10:32:30,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:30,556 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-08 10:32:30,556 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-08 10:32:30,557 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-08 10:32:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:30,558 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 10:32:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 10:32:30,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:30,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:30,559 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-08 10:32:30,559 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-08 10:32:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:30,561 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 10:32:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 10:32:30,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:30,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:30,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:30,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:30,562 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-08 10:32:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-08 10:32:30,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2022-04-08 10:32:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:30,562 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-08 10:32:30,562 INFO L479 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-08 10:32:30,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-08 10:32:30,580 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-08 10:32:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 10:32:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:32:30,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:30,581 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:30,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 10:32:30,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:30,795 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2064382877, now seen corresponding path program 9 times [2022-04-08 10:32:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:30,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1875629270] [2022-04-08 10:32:30,798 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:30,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2064382877, now seen corresponding path program 10 times [2022-04-08 10:32:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:30,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833009195] [2022-04-08 10:32:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:32:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:30,857 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-08 10:32:30,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-08 10:32:30,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-08 10:32:30,858 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-08 10:32:30,858 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-08 10:32:30,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-08 10:32:30,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-08 10:32:30,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-08 10:32:30,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1075#(= main_~a~0 0)} is VALID [2022-04-08 10:32:30,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(= main_~a~0 0)} assume !!(~a~0 < 6); {1075#(= main_~a~0 0)} is VALID [2022-04-08 10:32:30,860 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-08 10:32:30,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:30,860 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-08 10:32:30,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:30,861 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-08 10:32:30,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-08 10:32:30,862 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-08 10:32:30,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-08 10:32:30,862 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-08 10:32:30,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-08 10:32:30,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-08 10:32:30,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-08 10:32:30,863 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-08 10:32:30,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:30,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833009195] [2022-04-08 10:32:30,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833009195] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:32:30,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268407609] [2022-04-08 10:32:30,863 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:32:30,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:30,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:30,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 10:32:30,886 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:32:30,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:30,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:32:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:30,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:30,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-08 10:32:30,981 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-08 10:32:30,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-08 10:32:30,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-08 10:32:30,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-08 10:32:30,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1100#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:30,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {1100#(<= main_~a~0 0)} assume !!(~a~0 < 6); {1100#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:30,983 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-08 10:32:30,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:30,983 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-08 10:32:30,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:30,984 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-08 10:32:30,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-08 10:32:30,985 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-08 10:32:30,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-08 10:32:30,986 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-08 10:32:30,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-08 10:32:30,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-08 10:32:30,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-08 10:32:30,986 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-08 10:32:30,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:31,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-08 10:32:31,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-08 10:32:31,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-08 10:32:31,085 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-08 10:32:31,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-08 10:32:31,087 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-08 10:32:31,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-08 10:32:31,088 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-08 10:32:31,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-08 10:32:31,107 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-08 10:32:31,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-08 10:32:31,108 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-08 10:32:31,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {1100#(<= main_~a~0 0)} assume !!(~a~0 < 6); {1100#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:31,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1100#(<= main_~a~0 0)} is VALID [2022-04-08 10:32:31,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-08 10:32:31,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-08 10:32:31,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-08 10:32:31,109 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-08 10:32:31,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-08 10:32:31,109 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-08 10:32:31,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268407609] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:31,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:32:31,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-08 10:32:31,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:31,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1875629270] [2022-04-08 10:32:31,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1875629270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:31,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:31,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:32:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195022493] [2022-04-08 10:32:31,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:31,110 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-08 10:32:31,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:31,110 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-08 10:32:31,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:31,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:32:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:32:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:32:31,124 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-08 10:32:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:31,211 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:32:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:32:31,211 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-08 10:32:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:31,212 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-08 10:32:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2022-04-08 10:32:31,212 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-08 10:32:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2022-04-08 10:32:31,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 25 transitions. [2022-04-08 10:32:31,230 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-08 10:32:31,230 INFO L225 Difference]: With dead ends: 25 [2022-04-08 10:32:31,230 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 10:32:31,230 INFO L912 BasicCegarLoop]: 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-08 10:32:31,231 INFO L913 BasicCegarLoop]: 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-08 10:32:31,231 INFO L914 BasicCegarLoop]: 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-08 10:32:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 10:32:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 10:32:31,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:31,242 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-08 10:32:31,242 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-08 10:32:31,243 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-08 10:32:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:31,243 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:32:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:32:31,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:31,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:31,244 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-08 10:32:31,244 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-08 10:32:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:31,244 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:32:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:32:31,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:31,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:31,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:31,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:31,245 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-08 10:32:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-08 10:32:31,245 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2022-04-08 10:32:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:31,245 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-08 10:32:31,246 INFO L479 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-08 10:32:31,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-08 10:32:31,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:32:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:32:31,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:31,263 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:31,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 10:32:31,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:31,480 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash -401287493, now seen corresponding path program 11 times [2022-04-08 10:32:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:31,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [108746028] [2022-04-08 10:32:31,483 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:31,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash -401287493, now seen corresponding path program 12 times [2022-04-08 10:32:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:31,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898630355] [2022-04-08 10:32:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 10:32:31,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 10:32:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 10:32:31,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 10:32:31,514 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 10:32:31,514 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 10:32:31,516 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:32:31,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 10:32:31,519 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2] [2022-04-08 10:32:31,520 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:32:31,526 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 10:32:31,527 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 10:32:31,527 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-08 10:32:31,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:32:31 BoogieIcfgContainer [2022-04-08 10:32:31,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:32:31,529 INFO L158 Benchmark]: Toolchain (without parser) took 4262.57ms. Allocated memory was 179.3MB in the beginning and 297.8MB in the end (delta: 118.5MB). Free memory was 127.4MB in the beginning and 176.7MB in the end (delta: -49.3MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2022-04-08 10:32:31,529 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:32:31,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.29ms. Allocated memory was 179.3MB in the beginning and 297.8MB in the end (delta: 118.5MB). Free memory was 127.3MB in the beginning and 273.6MB in the end (delta: -146.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 10:32:31,529 INFO L158 Benchmark]: Boogie Preprocessor took 21.22ms. Allocated memory is still 297.8MB. Free memory was 273.6MB in the beginning and 272.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:32:31,529 INFO L158 Benchmark]: RCFGBuilder took 172.84ms. Allocated memory is still 297.8MB. Free memory was 272.1MB in the beginning and 262.6MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 10:32:31,529 INFO L158 Benchmark]: TraceAbstraction took 3907.50ms. Allocated memory is still 297.8MB. Free memory was 262.1MB in the beginning and 176.7MB in the end (delta: 85.4MB). Peak memory consumption was 85.9MB. Max. memory is 8.0GB. [2022-04-08 10:32:31,530 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.11ms. Allocated memory is still 179.3MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 156.29ms. Allocated memory was 179.3MB in the beginning and 297.8MB in the end (delta: 118.5MB). Free memory was 127.3MB in the beginning and 273.6MB in the end (delta: -146.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.22ms. Allocated memory is still 297.8MB. Free memory was 273.6MB in the beginning and 272.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 172.84ms. Allocated memory is still 297.8MB. Free memory was 272.1MB in the beginning and 262.6MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3907.50ms. Allocated memory is still 297.8MB. Free memory was 262.1MB in the beginning and 176.7MB in the end (delta: 85.4MB). Peak memory consumption was 85.9MB. 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: 3.9s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 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-08 10:32:31,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...