/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:07:20,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:07:20,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:07:20,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:07:20,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:07:20,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:07:20,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:07:20,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:07:20,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:07:20,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:07:20,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:07:20,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:07:20,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:07:20,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:07:20,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:07:20,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:07:20,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:07:20,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:07:20,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:07:20,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:07:20,313 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:07:20,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:07:20,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:07:20,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:07:20,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:07:20,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:07:20,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:07:20,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:07:20,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:07:20,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:07:20,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:07:20,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:07:20,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:07:20,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:07:20,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:07:20,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:07:20,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:07:20,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:07:20,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:07:20,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:07:20,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:07:20,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:07:20,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:07:20,346 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:07:20,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:07:20,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:07:20,347 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:07:20,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:07:20,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:07:20,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:07:20,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:07:20,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:07:20,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:07:20,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:07:20,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:07:20,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:07:20,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:07:20,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:07:20,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:07:20,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:07:20,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:07:20,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:07:20,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:07:20,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:07:20,351 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:07:20,351 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:07:20,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:07:20,351 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:07:20,352 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:07:20,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:07:20,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:07:20,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:07:20,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:07:20,579 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:07:20,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_4.c [2022-04-28 04:07:20,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2885ec7e/e741ad0dd0374e66970515fd41b6e4e1/FLAGf80f1351c [2022-04-28 04:07:21,001 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:07:21,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c [2022-04-28 04:07:21,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2885ec7e/e741ad0dd0374e66970515fd41b6e4e1/FLAGf80f1351c [2022-04-28 04:07:21,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2885ec7e/e741ad0dd0374e66970515fd41b6e4e1 [2022-04-28 04:07:21,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:07:21,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:07:21,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:07:21,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:07:21,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:07:21,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2148df3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21, skipping insertion in model container [2022-04-28 04:07:21,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:07:21,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:07:21,210 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_4.c[841,854] [2022-04-28 04:07:21,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:07:21,223 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:07:21,237 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_4.c[841,854] [2022-04-28 04:07:21,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:07:21,249 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:07:21,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21 WrapperNode [2022-04-28 04:07:21,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:07:21,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:07:21,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:07:21,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:07:21,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:07:21,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:07:21,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:07:21,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:07:21,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (1/1) ... [2022-04-28 04:07:21,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:07:21,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:07:21,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:07:21,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:07:21,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:07:21,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:07:21,340 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:07:21,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:07:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:07:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:07:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:07:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:07:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:07:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:07:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:07:21,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:07:21,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:07:21,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:07:21,396 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:07:21,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:07:21,497 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:07:21,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:07:21,503 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 04:07:21,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:07:21 BoogieIcfgContainer [2022-04-28 04:07:21,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:07:21,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:07:21,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:07:21,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:07:21,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:07:21" (1/3) ... [2022-04-28 04:07:21,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2015cff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:07:21, skipping insertion in model container [2022-04-28 04:07:21,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:21" (2/3) ... [2022-04-28 04:07:21,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2015cff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:07:21, skipping insertion in model container [2022-04-28 04:07:21,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:07:21" (3/3) ... [2022-04-28 04:07:21,528 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_4.c [2022-04-28 04:07:21,539 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:07:21,539 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:07:21,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:07:21,611 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ab6d9a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@678429fc [2022-04-28 04:07:21,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:07:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:07:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:07:21,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:21,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:21,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1467912619, now seen corresponding path program 1 times [2022-04-28 04:07:21,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:21,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486112308] [2022-04-28 04:07:21,649 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:07:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1467912619, now seen corresponding path program 2 times [2022-04-28 04:07:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:21,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200721737] [2022-04-28 04:07:21,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:21,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:21,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 04:07:21,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 04:07:21,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #68#return; {25#true} is VALID [2022-04-28 04:07:21,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:21,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 04:07:21,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 04:07:21,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #68#return; {25#true} is VALID [2022-04-28 04:07:21,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-28 04:07:21,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {25#true} is VALID [2022-04-28 04:07:21,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 04:07:21,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {26#false} is VALID [2022-04-28 04:07:21,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 04:07:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:21,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200721737] [2022-04-28 04:07:21,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200721737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:21,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:21,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:07:21,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:21,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486112308] [2022-04-28 04:07:21,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486112308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:21,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:21,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:07:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016943750] [2022-04-28 04:07:21,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:21,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 04:07:21,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:21,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:21,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:07:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:21,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:07:21,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:07:21,860 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:21,922 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2022-04-28 04:07:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:07:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 04:07:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 04:07:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 04:07:21,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-28 04:07:21,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:22,002 INFO L225 Difference]: With dead ends: 38 [2022-04-28 04:07:22,002 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 04:07:22,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:07:22,008 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:22,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 04:07:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 04:07:22,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:22,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,033 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,033 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,036 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 04:07:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 04:07:22,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:22,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:22,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 17 states. [2022-04-28 04:07:22,037 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 17 states. [2022-04-28 04:07:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,040 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 04:07:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 04:07:22,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:22,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:22,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:22,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-28 04:07:22,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-04-28 04:07:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:22,044 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-28 04:07:22,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-28 04:07:22,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 04:07:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:07:22,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:22,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:22,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:07:22,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1467952981, now seen corresponding path program 1 times [2022-04-28 04:07:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:22,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [604019794] [2022-04-28 04:07:22,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:07:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1467952981, now seen corresponding path program 2 times [2022-04-28 04:07:22,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:22,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497359250] [2022-04-28 04:07:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:22,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {177#true} is VALID [2022-04-28 04:07:22,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-28 04:07:22,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177#true} {177#true} #68#return; {177#true} is VALID [2022-04-28 04:07:22,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:22,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {177#true} is VALID [2022-04-28 04:07:22,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-28 04:07:22,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #68#return; {177#true} is VALID [2022-04-28 04:07:22,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret8 := main(); {177#true} is VALID [2022-04-28 04:07:22,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {182#(= main_~a~0 0)} is VALID [2022-04-28 04:07:22,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#(= main_~a~0 0)} assume !(~a~0 < 6); {178#false} is VALID [2022-04-28 04:07:22,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {178#false} is VALID [2022-04-28 04:07:22,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-04-28 04:07:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:22,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497359250] [2022-04-28 04:07:22,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497359250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:22,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:22,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:22,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:22,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [604019794] [2022-04-28 04:07:22,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [604019794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:22,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:22,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:22,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818805295] [2022-04-28 04:07:22,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:22,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 04:07:22,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:22,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:22,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:07:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:07:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:07:22,148 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,223 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 04:07:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:07:22,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 04:07:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-28 04:07:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-28 04:07:22,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-28 04:07:22,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:22,265 INFO L225 Difference]: With dead ends: 28 [2022-04-28 04:07:22,265 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 04:07:22,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:07:22,266 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:22,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 25 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 04:07:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2022-04-28 04:07:22,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:22,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,273 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,274 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,276 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-28 04:07:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-28 04:07:22,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:22,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:22,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 04:07:22,277 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 04:07:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,279 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-28 04:07:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-28 04:07:22,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:22,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:22,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:22,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 04:07:22,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2022-04-28 04:07:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:22,282 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 04:07:22,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-28 04:07:22,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 04:07:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:07:22,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:22,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:22,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:07:22,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash -408278750, now seen corresponding path program 1 times [2022-04-28 04:07:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:22,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1893012344] [2022-04-28 04:07:22,392 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:22,393 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1739867075, now seen corresponding path program 1 times [2022-04-28 04:07:22,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:22,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128229469] [2022-04-28 04:07:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:22,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {330#true} is VALID [2022-04-28 04:07:22,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-28 04:07:22,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {330#true} {330#true} #68#return; {330#true} is VALID [2022-04-28 04:07:22,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:22,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {330#true} is VALID [2022-04-28 04:07:22,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-28 04:07:22,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #68#return; {330#true} is VALID [2022-04-28 04:07:22,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret8 := main(); {330#true} is VALID [2022-04-28 04:07:22,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {335#(= main_~a~0 0)} is VALID [2022-04-28 04:07:22,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {335#(= main_~a~0 0)} [72] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_4| |v_main_#t~pre4_3|))) (or (and (= v_main_~b~0_10 v_main_~b~0_9) .cse0 (= v_main_~a~0_10 v_main_~a~0_9)) (and (= v_main_~b~0_9 v_main_~b~0_10) .cse0 (= v_main_~a~0_9 v_main_~a~0_10)))) InVars {main_~b~0=v_main_~b~0_10, main_#t~pre4=|v_main_#t~pre4_4|, main_~a~0=v_main_~a~0_10} OutVars{main_~b~0=v_main_~b~0_9, main_#t~pre4=|v_main_#t~pre4_3|, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_~a~0] {335#(= main_~a~0 0)} is VALID [2022-04-28 04:07:22,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {335#(= main_~a~0 0)} [71] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {331#false} is VALID [2022-04-28 04:07:22,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {331#false} is VALID [2022-04-28 04:07:22,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-28 04:07:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:22,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:22,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128229469] [2022-04-28 04:07:22,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128229469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:22,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:22,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:22,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:22,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1893012344] [2022-04-28 04:07:22,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1893012344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:22,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:22,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:07:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040080726] [2022-04-28 04:07:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:22,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:07:22,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:22,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:22,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:07:22,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:22,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:07:22,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:07:22,557 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,689 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-04-28 04:07:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:07:22,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:07:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-28 04:07:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-28 04:07:22,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-28 04:07:22,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:22,755 INFO L225 Difference]: With dead ends: 42 [2022-04-28 04:07:22,755 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 04:07:22,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:07:22,759 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:22,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 28 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 04:07:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2022-04-28 04:07:22,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:22,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,772 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,772 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,781 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-28 04:07:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-28 04:07:22,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:22,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:22,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 31 states. [2022-04-28 04:07:22,783 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 31 states. [2022-04-28 04:07:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:22,787 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-28 04:07:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-28 04:07:22,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:22,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:22,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:22,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-28 04:07:22,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-28 04:07:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:22,791 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-28 04:07:22,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:22,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-28 04:07:22,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 04:07:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:07:22,824 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:22,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:22,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:07:22,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:22,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash 675904015, now seen corresponding path program 1 times [2022-04-28 04:07:22,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:22,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76325349] [2022-04-28 04:07:22,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:23,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:23,014 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1739928579, now seen corresponding path program 1 times [2022-04-28 04:07:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:23,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731652457] [2022-04-28 04:07:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:23,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:23,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {528#true} is VALID [2022-04-28 04:07:23,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {528#true} assume true; {528#true} is VALID [2022-04-28 04:07:23,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {528#true} {528#true} #68#return; {528#true} is VALID [2022-04-28 04:07:23,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {528#true} call ULTIMATE.init(); {534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:23,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {528#true} is VALID [2022-04-28 04:07:23,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#true} assume true; {528#true} is VALID [2022-04-28 04:07:23,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {528#true} {528#true} #68#return; {528#true} is VALID [2022-04-28 04:07:23,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {528#true} call #t~ret8 := main(); {528#true} is VALID [2022-04-28 04:07:23,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {528#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {533#(= main_~a~0 0)} is VALID [2022-04-28 04:07:23,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {533#(= main_~a~0 0)} [74] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_10| |v_main_#t~pre5_9|)) (.cse1 (= |v_main_#t~pre4_9| |v_main_#t~pre4_8|)) (.cse2 (= v_main_~a~0_16 v_main_~a~0_15)) (.cse3 (= v_main_~b~0_23 v_main_~b~0_21))) (or (and .cse0 (= v_main_~c~0_16 v_main_~c~0_15) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_15 v_main_~c~0_16) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_16, main_~b~0=v_main_~b~0_23, main_#t~pre4=|v_main_#t~pre4_9|, main_#t~pre5=|v_main_#t~pre5_10|, main_~a~0=v_main_~a~0_16} OutVars{main_~c~0=v_main_~c~0_15, main_~b~0=v_main_~b~0_21, main_#t~pre4=|v_main_#t~pre4_8|, main_#t~pre5=|v_main_#t~pre5_9|, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {533#(= main_~a~0 0)} is VALID [2022-04-28 04:07:23,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#(= main_~a~0 0)} [73] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {529#false} is VALID [2022-04-28 04:07:23,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {529#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {529#false} is VALID [2022-04-28 04:07:23,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {529#false} assume !false; {529#false} is VALID [2022-04-28 04:07:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:23,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731652457] [2022-04-28 04:07:23,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731652457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:23,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:23,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:23,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:23,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76325349] [2022-04-28 04:07:23,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76325349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:23,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:23,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:07:23,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673258301] [2022-04-28 04:07:23,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:23,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:07:23,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:23,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:23,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:07:23,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:23,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:07:23,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:07:23,112 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:23,260 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-28 04:07:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:07:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:07:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-28 04:07:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-28 04:07:23,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-28 04:07:23,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:23,333 INFO L225 Difference]: With dead ends: 46 [2022-04-28 04:07:23,333 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:07:23,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:07:23,334 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:23,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 26 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:07:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2022-04-28 04:07:23,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:23,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,340 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,340 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:23,342 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 04:07:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 04:07:23,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:23,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:23,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 04:07:23,343 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 04:07:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:23,345 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 04:07:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 04:07:23,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:23,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:23,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:23,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 04:07:23,346 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2022-04-28 04:07:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:23,347 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 04:07:23,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 04:07:23,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 04:07:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:07:23,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:23,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:23,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 04:07:23,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:23,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash 919301982, now seen corresponding path program 1 times [2022-04-28 04:07:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:23,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [356335463] [2022-04-28 04:07:23,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:23,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:23,548 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:23,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:23,654 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1739990083, now seen corresponding path program 1 times [2022-04-28 04:07:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182789514] [2022-04-28 04:07:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:23,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:23,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {747#true} is VALID [2022-04-28 04:07:23,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-28 04:07:23,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #68#return; {747#true} is VALID [2022-04-28 04:07:23,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:23,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {747#true} is VALID [2022-04-28 04:07:23,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-28 04:07:23,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #68#return; {747#true} is VALID [2022-04-28 04:07:23,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret8 := main(); {747#true} is VALID [2022-04-28 04:07:23,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {747#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {752#(= main_~a~0 0)} is VALID [2022-04-28 04:07:23,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {752#(= main_~a~0 0)} [76] L22-3-->L22-4_primed: Formula: (and (= v_main_~b~0_36 v_main_~b~0_34) (= |v_main_#t~pre5_21| |v_main_#t~pre5_20|) (= v_main_~a~0_22 v_main_~a~0_21) (= |v_main_#t~pre6_21| |v_main_#t~pre6_20|) (= v_main_~c~0_41 v_main_~c~0_39) (= |v_main_#t~pre4_14| |v_main_#t~pre4_13|) (= v_main_~d~0_27 v_main_~d~0_26)) InVars {main_~c~0=v_main_~c~0_41, main_~d~0=v_main_~d~0_27, main_~b~0=v_main_~b~0_36, main_#t~pre4=|v_main_#t~pre4_14|, main_#t~pre5=|v_main_#t~pre5_21|, main_~a~0=v_main_~a~0_22, main_#t~pre6=|v_main_#t~pre6_21|} OutVars{main_~c~0=v_main_~c~0_39, main_~d~0=v_main_~d~0_26, main_~b~0=v_main_~b~0_34, main_#t~pre4=|v_main_#t~pre4_13|, main_#t~pre5=|v_main_#t~pre5_20|, main_~a~0=v_main_~a~0_21, main_#t~pre6=|v_main_#t~pre6_20|} AuxVars[] AssignedVars[main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {752#(= main_~a~0 0)} is VALID [2022-04-28 04:07:23,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {752#(= main_~a~0 0)} [75] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {748#false} is VALID [2022-04-28 04:07:23,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {748#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {748#false} is VALID [2022-04-28 04:07:23,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-04-28 04:07:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:23,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182789514] [2022-04-28 04:07:23,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182789514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:23,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:23,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:23,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:23,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [356335463] [2022-04-28 04:07:23,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [356335463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:23,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:23,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:07:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522329468] [2022-04-28 04:07:23,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:23,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 04:07:23,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:23,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:23,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:07:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:23,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:07:23,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:07:23,780 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:23,976 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 04:07:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:07:23,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 04:07:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-28 04:07:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-28 04:07:23,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-28 04:07:24,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:24,041 INFO L225 Difference]: With dead ends: 48 [2022-04-28 04:07:24,041 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 04:07:24,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:07:24,043 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:24,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 24 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 04:07:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2022-04-28 04:07:24,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:24,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:24,052 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:24,052 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:24,053 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 04:07:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-28 04:07:24,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:24,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:24,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 04:07:24,055 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 04:07:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:24,056 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 04:07:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-28 04:07:24,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:24,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:24,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:24,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 04:07:24,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2022-04-28 04:07:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:24,059 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 04:07:24,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:24,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 04:07:24,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:24,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 04:07:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 04:07:24,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:24,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:24,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 04:07:24,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1380235844, now seen corresponding path program 1 times [2022-04-28 04:07:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:24,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239431336] [2022-04-28 04:07:28,194 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:28,267 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:32,368 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:32,465 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:36,566 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:36,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:36,760 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:36,760 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1740051587, now seen corresponding path program 1 times [2022-04-28 04:07:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:36,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968460954] [2022-04-28 04:07:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:36,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {979#true} is VALID [2022-04-28 04:07:36,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#true} assume true; {979#true} is VALID [2022-04-28 04:07:36,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {979#true} {979#true} #68#return; {979#true} is VALID [2022-04-28 04:07:36,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:36,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {979#true} is VALID [2022-04-28 04:07:36,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {979#true} assume true; {979#true} is VALID [2022-04-28 04:07:36,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {979#true} {979#true} #68#return; {979#true} is VALID [2022-04-28 04:07:36,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {979#true} call #t~ret8 := main(); {979#true} is VALID [2022-04-28 04:07:36,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {979#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {984#(= main_~a~0 0)} is VALID [2022-04-28 04:07:36,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {984#(= main_~a~0 0)} [78] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_19| |v_main_#t~pre4_18|)) (.cse1 (= v_main_~b~0_44 v_main_~b~0_42)) (.cse2 (= v_main_~d~0_54 v_main_~d~0_52)) (.cse3 (= v_main_~a~0_28 v_main_~a~0_27)) (.cse4 (= |v_main_#t~pre6_28| |v_main_#t~pre6_27|)) (.cse5 (= |v_main_#t~pre5_27| |v_main_#t~pre5_26|)) (.cse6 (= |v_main_#t~pre7_22| |v_main_#t~pre7_21|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~c~0_49 v_main_~c~0_51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~c~0_51 v_main_~c~0_49)))) InVars {main_#t~pre7=|v_main_#t~pre7_22|, main_~c~0=v_main_~c~0_51, main_~d~0=v_main_~d~0_54, main_~b~0=v_main_~b~0_44, main_#t~pre4=|v_main_#t~pre4_19|, main_#t~pre5=|v_main_#t~pre5_27|, main_~a~0=v_main_~a~0_28, main_#t~pre6=|v_main_#t~pre6_28|} OutVars{main_#t~pre7=|v_main_#t~pre7_21|, main_~c~0=v_main_~c~0_49, main_~d~0=v_main_~d~0_52, main_~b~0=v_main_~b~0_42, main_#t~pre4=|v_main_#t~pre4_18|, main_#t~pre5=|v_main_#t~pre5_26|, main_~a~0=v_main_~a~0_27, main_#t~pre6=|v_main_#t~pre6_27|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {984#(= main_~a~0 0)} is VALID [2022-04-28 04:07:36,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {984#(= main_~a~0 0)} [77] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {980#false} is VALID [2022-04-28 04:07:36,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {980#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {980#false} is VALID [2022-04-28 04:07:36,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {980#false} assume !false; {980#false} is VALID [2022-04-28 04:07:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:36,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:36,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968460954] [2022-04-28 04:07:36,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968460954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:36,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:36,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:36,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:36,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1239431336] [2022-04-28 04:07:36,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1239431336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:36,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:36,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:07:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324480067] [2022-04-28 04:07:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:36,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 20 [2022-04-28 04:07:36,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:36,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:36,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:36,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:07:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:36,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:07:36,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:07:36,892 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:37,113 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-28 04:07:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:07:37,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 20 [2022-04-28 04:07:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-28 04:07:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-28 04:07:37,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-04-28 04:07:37,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:37,173 INFO L225 Difference]: With dead ends: 50 [2022-04-28 04:07:37,173 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 04:07:37,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:07:37,174 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:37,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 04:07:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 23. [2022-04-28 04:07:37,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:37,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,179 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,179 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:37,181 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-28 04:07:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-04-28 04:07:37,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:37,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:37,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 04:07:37,182 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 04:07:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:37,183 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-28 04:07:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-04-28 04:07:37,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:37,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:37,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:37,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 04:07:37,184 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2022-04-28 04:07:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:37,185 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 04:07:37,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 04:07:37,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 04:07:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:07:37,218 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:37,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:37,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 04:07:37,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:37,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:37,218 INFO L85 PathProgramCache]: Analyzing trace with hash 672070810, now seen corresponding path program 2 times [2022-04-28 04:07:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:37,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263023027] [2022-04-28 04:07:37,380 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:37,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:37,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:37,781 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:37,782 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1740113091, now seen corresponding path program 1 times [2022-04-28 04:07:37,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:37,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099248776] [2022-04-28 04:07:37,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:37,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {1232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1226#true} is VALID [2022-04-28 04:07:37,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-28 04:07:37,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1226#true} {1226#true} #68#return; {1226#true} is VALID [2022-04-28 04:07:37,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:37,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1226#true} is VALID [2022-04-28 04:07:37,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-28 04:07:37,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #68#return; {1226#true} is VALID [2022-04-28 04:07:37,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret8 := main(); {1226#true} is VALID [2022-04-28 04:07:37,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {1226#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1231#(= main_~a~0 0)} is VALID [2022-04-28 04:07:37,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(= main_~a~0 0)} [80] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_33| |v_main_#t~pre5_32|)) (.cse1 (= |v_main_#t~pre4_24| |v_main_#t~pre4_23|)) (.cse2 (= |v_main_#t~pre6_35| |v_main_#t~pre6_34|)) (.cse3 (= v_main_~d~0_87 v_main_~d~0_84)) (.cse4 (= v_main_~c~0_61 v_main_~c~0_59)) (.cse5 (= v_main_~a~0_34 v_main_~a~0_33)) (.cse6 (= v_main_~b~0_52 v_main_~b~0_50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_49| |v_main_#t~pre7_47|) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_47| |v_main_#t~pre7_49|) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_49|, main_~c~0=v_main_~c~0_61, main_~d~0=v_main_~d~0_87, main_~b~0=v_main_~b~0_52, main_#t~pre4=|v_main_#t~pre4_24|, main_#t~pre5=|v_main_#t~pre5_33|, main_~a~0=v_main_~a~0_34, main_#t~pre6=|v_main_#t~pre6_35|} OutVars{main_#t~pre7=|v_main_#t~pre7_47|, main_~c~0=v_main_~c~0_59, main_~d~0=v_main_~d~0_84, main_~b~0=v_main_~b~0_50, main_#t~pre4=|v_main_#t~pre4_23|, main_#t~pre5=|v_main_#t~pre5_32|, main_~a~0=v_main_~a~0_33, main_#t~pre6=|v_main_#t~pre6_34|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1231#(= main_~a~0 0)} is VALID [2022-04-28 04:07:37,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(= main_~a~0 0)} [79] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1227#false} is VALID [2022-04-28 04:07:37,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1227#false} is VALID [2022-04-28 04:07:37,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2022-04-28 04:07:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:37,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:37,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099248776] [2022-04-28 04:07:37,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099248776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:37,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:37,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:37,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:37,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263023027] [2022-04-28 04:07:37,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263023027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:37,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:37,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:07:37,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178820072] [2022-04-28 04:07:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:37,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 22 [2022-04-28 04:07:37,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:37,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:37,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:37,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:07:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:07:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:07:37,960 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:38,238 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-04-28 04:07:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:07:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 22 [2022-04-28 04:07:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-28 04:07:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-28 04:07:38,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-28 04:07:38,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:38,303 INFO L225 Difference]: With dead ends: 52 [2022-04-28 04:07:38,303 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 04:07:38,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:07:38,304 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:38,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 34 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 04:07:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2022-04-28 04:07:38,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:38,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:38,310 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:38,310 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:38,312 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 04:07:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 04:07:38,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:38,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:38,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 04:07:38,312 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 04:07:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:38,313 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 04:07:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 04:07:38,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:38,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:38,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:38,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 04:07:38,315 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2022-04-28 04:07:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:38,315 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 04:07:38,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:38,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 04:07:38,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 04:07:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:07:38,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:38,350 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:38,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 04:07:38,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:38,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1548776440, now seen corresponding path program 3 times [2022-04-28 04:07:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:38,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947573238] [2022-04-28 04:07:38,518 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:38,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:38,801 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:38,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:38,925 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1740174595, now seen corresponding path program 1 times [2022-04-28 04:07:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:38,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393802980] [2022-04-28 04:07:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:38,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:38,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {1494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1488#true} is VALID [2022-04-28 04:07:38,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-04-28 04:07:38,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1488#true} {1488#true} #68#return; {1488#true} is VALID [2022-04-28 04:07:38,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:38,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {1494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1488#true} is VALID [2022-04-28 04:07:38,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-04-28 04:07:38,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #68#return; {1488#true} is VALID [2022-04-28 04:07:38,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret8 := main(); {1488#true} is VALID [2022-04-28 04:07:38,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {1488#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1493#(= main_~a~0 0)} is VALID [2022-04-28 04:07:38,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {1493#(= main_~a~0 0)} [82] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_39| |v_main_#t~pre5_38|)) (.cse1 (= v_main_~a~0_40 v_main_~a~0_39)) (.cse2 (= |v_main_#t~pre6_42| |v_main_#t~pre6_41|)) (.cse3 (= v_main_~d~0_124 v_main_~d~0_120)) (.cse4 (= |v_main_#t~pre7_79| |v_main_#t~pre7_76|)) (.cse5 (= |v_main_#t~pre4_29| |v_main_#t~pre4_28|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_71 v_main_~c~0_69) .cse4 .cse5 (= v_main_~b~0_60 v_main_~b~0_58)) (and .cse0 (= v_main_~c~0_69 v_main_~c~0_71) .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~b~0_58 v_main_~b~0_60)))) InVars {main_#t~pre7=|v_main_#t~pre7_79|, main_~c~0=v_main_~c~0_71, main_~d~0=v_main_~d~0_124, main_~b~0=v_main_~b~0_60, main_#t~pre4=|v_main_#t~pre4_29|, main_#t~pre5=|v_main_#t~pre5_39|, main_~a~0=v_main_~a~0_40, main_#t~pre6=|v_main_#t~pre6_42|} OutVars{main_#t~pre7=|v_main_#t~pre7_76|, main_~c~0=v_main_~c~0_69, main_~d~0=v_main_~d~0_120, main_~b~0=v_main_~b~0_58, main_#t~pre4=|v_main_#t~pre4_28|, main_#t~pre5=|v_main_#t~pre5_38|, main_~a~0=v_main_~a~0_39, main_#t~pre6=|v_main_#t~pre6_41|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1493#(= main_~a~0 0)} is VALID [2022-04-28 04:07:38,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {1493#(= main_~a~0 0)} [81] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1489#false} is VALID [2022-04-28 04:07:38,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {1489#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1489#false} is VALID [2022-04-28 04:07:38,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2022-04-28 04:07:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:38,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393802980] [2022-04-28 04:07:38,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393802980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:38,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:38,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:39,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:39,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947573238] [2022-04-28 04:07:39,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947573238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:39,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:39,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:07:39,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782554794] [2022-04-28 04:07:39,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:39,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 24 [2022-04-28 04:07:39,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:39,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:39,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:07:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:07:39,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:07:39,130 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:39,426 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-28 04:07:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:07:39,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 24 [2022-04-28 04:07:39,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-28 04:07:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-28 04:07:39,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-28 04:07:39,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:39,485 INFO L225 Difference]: With dead ends: 54 [2022-04-28 04:07:39,485 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 04:07:39,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:07:39,486 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:39,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 24 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 04:07:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-04-28 04:07:39,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:39,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,492 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,492 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:39,494 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-28 04:07:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-28 04:07:39,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:39,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:39,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 43 states. [2022-04-28 04:07:39,494 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 43 states. [2022-04-28 04:07:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:39,496 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-28 04:07:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-28 04:07:39,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:39,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:39,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:39,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 04:07:39,497 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2022-04-28 04:07:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:39,497 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 04:07:39,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 04:07:39,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 04:07:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:07:39,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:39,530 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:39,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 04:07:39,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2045670442, now seen corresponding path program 4 times [2022-04-28 04:07:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:39,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1849938165] [2022-04-28 04:07:43,637 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:43,698 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:45,825 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:45,897 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:48,248 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:48,330 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:48,441 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:48,441 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1740236099, now seen corresponding path program 1 times [2022-04-28 04:07:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:48,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422027786] [2022-04-28 04:07:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:48,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1765#true} is VALID [2022-04-28 04:07:48,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {1765#true} assume true; {1765#true} is VALID [2022-04-28 04:07:48,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1765#true} {1765#true} #68#return; {1765#true} is VALID [2022-04-28 04:07:48,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {1765#true} call ULTIMATE.init(); {1771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:48,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1765#true} is VALID [2022-04-28 04:07:48,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1765#true} assume true; {1765#true} is VALID [2022-04-28 04:07:48,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1765#true} {1765#true} #68#return; {1765#true} is VALID [2022-04-28 04:07:48,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {1765#true} call #t~ret8 := main(); {1765#true} is VALID [2022-04-28 04:07:48,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {1765#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1770#(= main_~a~0 0)} is VALID [2022-04-28 04:07:48,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {1770#(= main_~a~0 0)} [84] L22-3-->L22-4_primed: Formula: (and (= v_main_~d~0_165 v_main_~d~0_160) (= |v_main_#t~pre6_49| |v_main_#t~pre6_48|) (= v_main_~c~0_81 v_main_~c~0_79) (= |v_main_#t~pre7_112| |v_main_#t~pre7_108|) (= v_main_~b~0_68 v_main_~b~0_66) (= |v_main_#t~pre4_34| |v_main_#t~pre4_33|) (= |v_main_#t~pre5_45| |v_main_#t~pre5_44|) (= v_main_~a~0_46 v_main_~a~0_45)) InVars {main_#t~pre7=|v_main_#t~pre7_112|, main_~c~0=v_main_~c~0_81, main_~d~0=v_main_~d~0_165, main_~b~0=v_main_~b~0_68, main_#t~pre4=|v_main_#t~pre4_34|, main_#t~pre5=|v_main_#t~pre5_45|, main_~a~0=v_main_~a~0_46, main_#t~pre6=|v_main_#t~pre6_49|} OutVars{main_#t~pre7=|v_main_#t~pre7_108|, main_~c~0=v_main_~c~0_79, main_~d~0=v_main_~d~0_160, main_~b~0=v_main_~b~0_66, main_#t~pre4=|v_main_#t~pre4_33|, main_#t~pre5=|v_main_#t~pre5_44|, main_~a~0=v_main_~a~0_45, main_#t~pre6=|v_main_#t~pre6_48|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1770#(= main_~a~0 0)} is VALID [2022-04-28 04:07:48,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#(= main_~a~0 0)} [83] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1766#false} is VALID [2022-04-28 04:07:48,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {1766#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1766#false} is VALID [2022-04-28 04:07:48,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {1766#false} assume !false; {1766#false} is VALID [2022-04-28 04:07:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:48,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422027786] [2022-04-28 04:07:48,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422027786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:48,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:48,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:48,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:48,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1849938165] [2022-04-28 04:07:48,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1849938165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:48,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:48,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:07:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401378466] [2022-04-28 04:07:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:48,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 26 [2022-04-28 04:07:48,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:48,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:48,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:48,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:07:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:48,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:07:48,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:07:48,667 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:48,976 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-04-28 04:07:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:07:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 26 [2022-04-28 04:07:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2022-04-28 04:07:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2022-04-28 04:07:48,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 69 transitions. [2022-04-28 04:07:49,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:49,042 INFO L225 Difference]: With dead ends: 56 [2022-04-28 04:07:49,042 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 04:07:49,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:07:49,045 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:49,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 24 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 04:07:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2022-04-28 04:07:49,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:49,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:49,059 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:49,060 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:49,062 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-28 04:07:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-04-28 04:07:49,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:49,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:49,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 45 states. [2022-04-28 04:07:49,065 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 45 states. [2022-04-28 04:07:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:49,067 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-28 04:07:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-04-28 04:07:49,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:49,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:49,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:49,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-28 04:07:49,069 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2022-04-28 04:07:49,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:49,069 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-28 04:07:49,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:49,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-28 04:07:49,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 04:07:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:07:49,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:49,107 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:49,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 04:07:49,107 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1139549236, now seen corresponding path program 5 times [2022-04-28 04:07:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:49,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795273455] [2022-04-28 04:07:49,272 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:49,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:49,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:49,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:49,654 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1740297603, now seen corresponding path program 1 times [2022-04-28 04:07:49,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:49,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709458625] [2022-04-28 04:07:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:49,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {2063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2057#true} is VALID [2022-04-28 04:07:49,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {2057#true} assume true; {2057#true} is VALID [2022-04-28 04:07:49,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2057#true} {2057#true} #68#return; {2057#true} is VALID [2022-04-28 04:07:49,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {2057#true} call ULTIMATE.init(); {2063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:49,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {2063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2057#true} is VALID [2022-04-28 04:07:49,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#true} assume true; {2057#true} is VALID [2022-04-28 04:07:49,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#true} {2057#true} #68#return; {2057#true} is VALID [2022-04-28 04:07:49,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#true} call #t~ret8 := main(); {2057#true} is VALID [2022-04-28 04:07:49,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2062#(= main_~a~0 0)} is VALID [2022-04-28 04:07:49,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {2062#(= main_~a~0 0)} [86] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_148| |v_main_#t~pre7_143|)) (.cse1 (= |v_main_#t~pre4_39| |v_main_#t~pre4_38|)) (.cse2 (= v_main_~a~0_52 v_main_~a~0_51)) (.cse3 (= |v_main_#t~pre6_56| |v_main_#t~pre6_55|)) (.cse4 (= |v_main_#t~pre5_51| |v_main_#t~pre5_50|)) (.cse5 (= v_main_~b~0_76 v_main_~b~0_74))) (or (and .cse0 (= v_main_~d~0_210 v_main_~d~0_204) .cse1 (= v_main_~c~0_91 v_main_~c~0_89) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= v_main_~c~0_89 v_main_~c~0_91) .cse1 (= v_main_~d~0_204 v_main_~d~0_210) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_148|, main_~c~0=v_main_~c~0_91, main_~d~0=v_main_~d~0_210, main_~b~0=v_main_~b~0_76, main_#t~pre4=|v_main_#t~pre4_39|, main_#t~pre5=|v_main_#t~pre5_51|, main_~a~0=v_main_~a~0_52, main_#t~pre6=|v_main_#t~pre6_56|} OutVars{main_#t~pre7=|v_main_#t~pre7_143|, main_~c~0=v_main_~c~0_89, main_~d~0=v_main_~d~0_204, main_~b~0=v_main_~b~0_74, main_#t~pre4=|v_main_#t~pre4_38|, main_#t~pre5=|v_main_#t~pre5_50|, main_~a~0=v_main_~a~0_51, main_#t~pre6=|v_main_#t~pre6_55|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2062#(= main_~a~0 0)} is VALID [2022-04-28 04:07:49,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {2062#(= main_~a~0 0)} [85] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2058#false} is VALID [2022-04-28 04:07:49,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {2058#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2058#false} is VALID [2022-04-28 04:07:49,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {2058#false} assume !false; {2058#false} is VALID [2022-04-28 04:07:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:49,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:49,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709458625] [2022-04-28 04:07:49,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709458625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:49,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:49,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:49,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:49,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795273455] [2022-04-28 04:07:49,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795273455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:49,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:49,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 04:07:49,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866990465] [2022-04-28 04:07:49,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:49,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 28 [2022-04-28 04:07:49,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:49,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:49,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:49,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 04:07:49,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:49,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 04:07:49,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:07:49,865 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:50,298 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-28 04:07:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 04:07:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 28 [2022-04-28 04:07:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-04-28 04:07:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-04-28 04:07:50,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 71 transitions. [2022-04-28 04:07:50,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:50,355 INFO L225 Difference]: With dead ends: 58 [2022-04-28 04:07:50,355 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 04:07:50,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:07:50,356 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:50,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 29 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:07:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 04:07:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-04-28 04:07:50,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:50,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:50,364 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:50,364 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:50,365 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-28 04:07:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 04:07:50,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:50,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:50,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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 47 states. [2022-04-28 04:07:50,365 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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 47 states. [2022-04-28 04:07:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:50,366 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-28 04:07:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-28 04:07:50,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:50,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:50,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:50,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 04:07:50,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2022-04-28 04:07:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:50,368 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 04:07:50,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:50,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-28 04:07:50,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 04:07:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 04:07:50,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:50,409 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:50,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 04:07:50,410 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash -176022254, now seen corresponding path program 6 times [2022-04-28 04:07:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:50,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837174781] [2022-04-28 04:07:52,934 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:52,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:56,412 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:56,463 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:00,554 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:00,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:00,731 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:00,731 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:00,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1740359107, now seen corresponding path program 1 times [2022-04-28 04:08:00,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:00,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699981091] [2022-04-28 04:08:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:00,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2364#true} is VALID [2022-04-28 04:08:00,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-28 04:08:00,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2364#true} {2364#true} #68#return; {2364#true} is VALID [2022-04-28 04:08:00,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:00,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2364#true} is VALID [2022-04-28 04:08:00,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-28 04:08:00,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #68#return; {2364#true} is VALID [2022-04-28 04:08:00,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret8 := main(); {2364#true} is VALID [2022-04-28 04:08:00,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2369#(= main_~a~0 0)} is VALID [2022-04-28 04:08:00,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {2369#(= main_~a~0 0)} [88] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_101 v_main_~c~0_99)) (.cse1 (= |v_main_#t~pre4_44| |v_main_#t~pre4_43|)) (.cse2 (= v_main_~d~0_259 v_main_~d~0_252)) (.cse3 (= |v_main_#t~pre6_63| |v_main_#t~pre6_62|)) (.cse4 (= |v_main_#t~pre5_57| |v_main_#t~pre5_56|)) (.cse5 (= v_main_~b~0_84 v_main_~b~0_82))) (or (and .cse0 (= |v_main_#t~pre7_181| |v_main_#t~pre7_187|) (= v_main_~a~0_57 v_main_~a~0_58) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre7_187| |v_main_#t~pre7_181|) .cse3 .cse4 (= v_main_~a~0_58 v_main_~a~0_57) .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_187|, main_~c~0=v_main_~c~0_101, main_~d~0=v_main_~d~0_259, main_~b~0=v_main_~b~0_84, main_#t~pre4=|v_main_#t~pre4_44|, main_#t~pre5=|v_main_#t~pre5_57|, main_~a~0=v_main_~a~0_58, main_#t~pre6=|v_main_#t~pre6_63|} OutVars{main_#t~pre7=|v_main_#t~pre7_181|, main_~c~0=v_main_~c~0_99, main_~d~0=v_main_~d~0_252, main_~b~0=v_main_~b~0_82, main_#t~pre4=|v_main_#t~pre4_43|, main_#t~pre5=|v_main_#t~pre5_56|, main_~a~0=v_main_~a~0_57, main_#t~pre6=|v_main_#t~pre6_62|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2369#(= main_~a~0 0)} is VALID [2022-04-28 04:08:00,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {2369#(= main_~a~0 0)} [87] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2365#false} is VALID [2022-04-28 04:08:00,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {2365#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2365#false} is VALID [2022-04-28 04:08:00,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-28 04:08:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:00,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699981091] [2022-04-28 04:08:00,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699981091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:00,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:00,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:00,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:00,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837174781] [2022-04-28 04:08:00,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837174781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:00,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:00,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 04:08:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646137326] [2022-04-28 04:08:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 30 [2022-04-28 04:08:00,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:00,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:00,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:00,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 04:08:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:00,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 04:08:00,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:08:00,994 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:01,462 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-28 04:08:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:08:01,463 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 30 [2022-04-28 04:08:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-28 04:08:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-28 04:08:01,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2022-04-28 04:08:01,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:01,527 INFO L225 Difference]: With dead ends: 58 [2022-04-28 04:08:01,527 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 04:08:01,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:08:01,528 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:01,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 38 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:08:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 04:08:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-04-28 04:08:01,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:01,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:01,537 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:01,537 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:01,538 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 04:08:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 04:08:01,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:01,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:01,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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 47 states. [2022-04-28 04:08:01,538 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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 47 states. [2022-04-28 04:08:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:01,539 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 04:08:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 04:08:01,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:01,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:01,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:01,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-28 04:08:01,541 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 30 [2022-04-28 04:08:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:01,541 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-28 04:08:01,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:01,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-28 04:08:01,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 04:08:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 04:08:01,592 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:01,592 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:01,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 04:08:01,592 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash 145574267, now seen corresponding path program 7 times [2022-04-28 04:08:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:01,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203384144] [2022-04-28 04:08:03,778 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:03,824 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:06,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:08,969 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:09,025 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:09,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:09,119 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1740420611, now seen corresponding path program 1 times [2022-04-28 04:08:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:09,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601077252] [2022-04-28 04:08:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:09,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {2691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2685#true} is VALID [2022-04-28 04:08:09,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {2685#true} assume true; {2685#true} is VALID [2022-04-28 04:08:09,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2685#true} {2685#true} #68#return; {2685#true} is VALID [2022-04-28 04:08:09,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {2685#true} call ULTIMATE.init(); {2691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:09,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {2691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2685#true} is VALID [2022-04-28 04:08:09,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {2685#true} assume true; {2685#true} is VALID [2022-04-28 04:08:09,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2685#true} {2685#true} #68#return; {2685#true} is VALID [2022-04-28 04:08:09,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {2685#true} call #t~ret8 := main(); {2685#true} is VALID [2022-04-28 04:08:09,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {2685#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2690#(= main_~a~0 0)} is VALID [2022-04-28 04:08:09,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {2690#(= main_~a~0 0)} [90] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_118 v_main_~c~0_115)) (.cse1 (= |v_main_#t~pre7_226| |v_main_#t~pre7_220|)) (.cse2 (= |v_main_#t~pre6_74| |v_main_#t~pre6_72|)) (.cse3 (= v_main_~b~0_92 v_main_~b~0_90)) (.cse4 (= |v_main_#t~pre4_49| |v_main_#t~pre4_48|)) (.cse5 (= |v_main_#t~pre5_63| |v_main_#t~pre5_62|)) (.cse6 (= v_main_~a~0_64 v_main_~a~0_63))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_314 v_main_~d~0_306) .cse5 .cse6) (and (= v_main_~d~0_306 v_main_~d~0_314) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_226|, main_~c~0=v_main_~c~0_118, main_~d~0=v_main_~d~0_314, main_~b~0=v_main_~b~0_92, main_#t~pre4=|v_main_#t~pre4_49|, main_#t~pre5=|v_main_#t~pre5_63|, main_~a~0=v_main_~a~0_64, main_#t~pre6=|v_main_#t~pre6_74|} OutVars{main_#t~pre7=|v_main_#t~pre7_220|, main_~c~0=v_main_~c~0_115, main_~d~0=v_main_~d~0_306, main_~b~0=v_main_~b~0_90, main_#t~pre4=|v_main_#t~pre4_48|, main_#t~pre5=|v_main_#t~pre5_62|, main_~a~0=v_main_~a~0_63, main_#t~pre6=|v_main_#t~pre6_72|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2690#(= main_~a~0 0)} is VALID [2022-04-28 04:08:09,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {2690#(= main_~a~0 0)} [89] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2686#false} is VALID [2022-04-28 04:08:09,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {2686#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2686#false} is VALID [2022-04-28 04:08:09,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {2686#false} assume !false; {2686#false} is VALID [2022-04-28 04:08:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:09,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:09,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601077252] [2022-04-28 04:08:09,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601077252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:09,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:09,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:09,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:09,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203384144] [2022-04-28 04:08:09,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203384144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:09,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:09,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:08:09,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940738435] [2022-04-28 04:08:09,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:09,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 33 [2022-04-28 04:08:09,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:09,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:09,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:08:09,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:08:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:08:09,406 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:09,945 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-04-28 04:08:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:08:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 33 [2022-04-28 04:08:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-28 04:08:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-28 04:08:09,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 72 transitions. [2022-04-28 04:08:10,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:10,020 INFO L225 Difference]: With dead ends: 60 [2022-04-28 04:08:10,020 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 04:08:10,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:08:10,021 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:10,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 28 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:08:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 04:08:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-04-28 04:08:10,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:10,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:10,030 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:10,030 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:10,031 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-28 04:08:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-28 04:08:10,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:10,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:10,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 49 states. [2022-04-28 04:08:10,032 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 49 states. [2022-04-28 04:08:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:10,033 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-28 04:08:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-28 04:08:10,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:10,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:10,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:10,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-28 04:08:10,035 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 33 [2022-04-28 04:08:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:10,035 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-28 04:08:10,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:10,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-28 04:08:10,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 04:08:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 04:08:10,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:10,089 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:10,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 04:08:10,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1903227751, now seen corresponding path program 8 times [2022-04-28 04:08:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:10,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193672531] [2022-04-28 04:08:10,330 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:14,425 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:14,488 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:14,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:14,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:14,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:18,975 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:19,034 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:19,183 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:19,183 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1740482115, now seen corresponding path program 1 times [2022-04-28 04:08:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:19,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069692494] [2022-04-28 04:08:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:19,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {3025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3019#true} is VALID [2022-04-28 04:08:19,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#true} assume true; {3019#true} is VALID [2022-04-28 04:08:19,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3019#true} {3019#true} #68#return; {3019#true} is VALID [2022-04-28 04:08:19,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {3019#true} call ULTIMATE.init(); {3025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:19,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {3025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3019#true} is VALID [2022-04-28 04:08:19,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#true} assume true; {3019#true} is VALID [2022-04-28 04:08:19,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3019#true} {3019#true} #68#return; {3019#true} is VALID [2022-04-28 04:08:19,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {3019#true} call #t~ret8 := main(); {3019#true} is VALID [2022-04-28 04:08:19,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {3019#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3024#(= main_~a~0 0)} is VALID [2022-04-28 04:08:19,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {3024#(= main_~a~0 0)} [92] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_54| |v_main_#t~pre4_53|)) (.cse1 (= |v_main_#t~pre7_279| |v_main_#t~pre7_272|)) (.cse2 (= v_main_~b~0_100 v_main_~b~0_98))) (or (and (= v_main_~a~0_69 v_main_~a~0_70) (= v_main_~c~0_149 v_main_~c~0_152) .cse0 .cse1 (= v_main_~d~0_382 v_main_~d~0_391) .cse2 (= |v_main_#t~pre6_99| |v_main_#t~pre6_101|) (= |v_main_#t~pre5_68| |v_main_#t~pre5_69|)) (and (= v_main_~c~0_152 v_main_~c~0_149) .cse0 (= |v_main_#t~pre6_101| |v_main_#t~pre6_99|) .cse1 .cse2 (= |v_main_#t~pre5_69| |v_main_#t~pre5_68|) (= v_main_~d~0_391 v_main_~d~0_382) (= v_main_~a~0_70 v_main_~a~0_69)))) InVars {main_#t~pre7=|v_main_#t~pre7_279|, main_~c~0=v_main_~c~0_152, main_~d~0=v_main_~d~0_391, main_~b~0=v_main_~b~0_100, main_#t~pre4=|v_main_#t~pre4_54|, main_#t~pre5=|v_main_#t~pre5_69|, main_~a~0=v_main_~a~0_70, main_#t~pre6=|v_main_#t~pre6_101|} OutVars{main_#t~pre7=|v_main_#t~pre7_272|, main_~c~0=v_main_~c~0_149, main_~d~0=v_main_~d~0_382, main_~b~0=v_main_~b~0_98, main_#t~pre4=|v_main_#t~pre4_53|, main_#t~pre5=|v_main_#t~pre5_68|, main_~a~0=v_main_~a~0_69, main_#t~pre6=|v_main_#t~pre6_99|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3024#(= main_~a~0 0)} is VALID [2022-04-28 04:08:19,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {3024#(= main_~a~0 0)} [91] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3020#false} is VALID [2022-04-28 04:08:19,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {3020#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3020#false} is VALID [2022-04-28 04:08:19,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2022-04-28 04:08:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:19,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069692494] [2022-04-28 04:08:19,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069692494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:19,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:19,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:19,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:19,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193672531] [2022-04-28 04:08:19,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193672531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:19,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:19,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:08:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405320728] [2022-04-28 04:08:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:19,490 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 35 [2022-04-28 04:08:19,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:19,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:19,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:08:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:08:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:08:19,521 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:20,121 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-04-28 04:08:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 04:08:20,122 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 35 [2022-04-28 04:08:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 04:08:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 04:08:20,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-28 04:08:20,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:20,178 INFO L225 Difference]: With dead ends: 62 [2022-04-28 04:08:20,178 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:08:20,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:08:20,179 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:20,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 38 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:08:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:08:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-04-28 04:08:20,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:20,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:20,191 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:20,191 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:20,192 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 04:08:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 04:08:20,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:20,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:20,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 51 states. [2022-04-28 04:08:20,193 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 51 states. [2022-04-28 04:08:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:20,196 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 04:08:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 04:08:20,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:20,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:20,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:20,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 04:08:20,197 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2022-04-28 04:08:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:20,197 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 04:08:20,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:20,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 04:08:20,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 04:08:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 04:08:20,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:20,246 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:20,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 04:08:20,246 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:20,247 INFO L85 PathProgramCache]: Analyzing trace with hash 588021815, now seen corresponding path program 9 times [2022-04-28 04:08:20,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:20,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980894710] [2022-04-28 04:08:20,476 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:20,610 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:20,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:20,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:21,031 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:21,186 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:21,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:21,296 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1740543619, now seen corresponding path program 1 times [2022-04-28 04:08:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:21,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700868083] [2022-04-28 04:08:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:21,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:21,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {3374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3368#true} is VALID [2022-04-28 04:08:21,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {3368#true} assume true; {3368#true} is VALID [2022-04-28 04:08:21,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3368#true} {3368#true} #68#return; {3368#true} is VALID [2022-04-28 04:08:21,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {3368#true} call ULTIMATE.init(); {3374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:21,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {3374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3368#true} is VALID [2022-04-28 04:08:21,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {3368#true} assume true; {3368#true} is VALID [2022-04-28 04:08:21,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3368#true} {3368#true} #68#return; {3368#true} is VALID [2022-04-28 04:08:21,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {3368#true} call #t~ret8 := main(); {3368#true} is VALID [2022-04-28 04:08:21,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {3368#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3373#(= main_~a~0 0)} is VALID [2022-04-28 04:08:21,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {3373#(= main_~a~0 0)} [94] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_108 v_main_~b~0_106)) (.cse1 (= v_main_~c~0_186 v_main_~c~0_183)) (.cse2 (= |v_main_#t~pre5_75| |v_main_#t~pre5_74|)) (.cse3 (= v_main_~a~0_76 v_main_~a~0_75)) (.cse4 (= |v_main_#t~pre6_128| |v_main_#t~pre6_126|)) (.cse5 (= |v_main_#t~pre4_59| |v_main_#t~pre4_58|))) (or (and .cse0 (= v_main_~d~0_472 v_main_~d~0_462) .cse1 (= |v_main_#t~pre7_340| |v_main_#t~pre7_332|) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |v_main_#t~pre7_332| |v_main_#t~pre7_340|) .cse1 .cse2 (= v_main_~d~0_462 v_main_~d~0_472) .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_340|, main_~c~0=v_main_~c~0_186, main_~d~0=v_main_~d~0_472, main_~b~0=v_main_~b~0_108, main_#t~pre4=|v_main_#t~pre4_59|, main_#t~pre5=|v_main_#t~pre5_75|, main_~a~0=v_main_~a~0_76, main_#t~pre6=|v_main_#t~pre6_128|} OutVars{main_#t~pre7=|v_main_#t~pre7_332|, main_~c~0=v_main_~c~0_183, main_~d~0=v_main_~d~0_462, main_~b~0=v_main_~b~0_106, main_#t~pre4=|v_main_#t~pre4_58|, main_#t~pre5=|v_main_#t~pre5_74|, main_~a~0=v_main_~a~0_75, main_#t~pre6=|v_main_#t~pre6_126|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3373#(= main_~a~0 0)} is VALID [2022-04-28 04:08:21,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {3373#(= main_~a~0 0)} [93] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3369#false} is VALID [2022-04-28 04:08:21,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {3369#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3369#false} is VALID [2022-04-28 04:08:21,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {3369#false} assume !false; {3369#false} is VALID [2022-04-28 04:08:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:21,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700868083] [2022-04-28 04:08:21,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700868083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:21,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:21,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:21,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980894710] [2022-04-28 04:08:21,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980894710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:21,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:21,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:08:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385970546] [2022-04-28 04:08:21,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:21,607 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 37 [2022-04-28 04:08:21,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:21,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:21,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:21,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:08:21,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:21,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:08:21,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:08:21,639 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:22,228 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-04-28 04:08:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 04:08:22,228 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 37 [2022-04-28 04:08:22,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 04:08:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 04:08:22,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-28 04:08:22,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:22,305 INFO L225 Difference]: With dead ends: 64 [2022-04-28 04:08:22,306 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 04:08:22,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:08:22,307 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:22,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 38 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:08:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 04:08:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-28 04:08:22,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:22,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:22,316 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:22,316 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:22,317 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 04:08:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 04:08:22,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:22,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:22,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 53 states. [2022-04-28 04:08:22,317 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 53 states. [2022-04-28 04:08:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:22,318 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 04:08:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 04:08:22,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:22,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:22,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:22,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 04:08:22,320 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2022-04-28 04:08:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:22,320 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 04:08:22,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:22,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 04:08:22,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 04:08:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 04:08:22,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:22,373 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:22,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 04:08:22,373 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1912896427, now seen corresponding path program 10 times [2022-04-28 04:08:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:22,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305907802] [2022-04-28 04:08:22,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:22,755 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:22,873 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:22,999 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:23,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:23,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:23,366 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:23,366 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1740605123, now seen corresponding path program 1 times [2022-04-28 04:08:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:23,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239602535] [2022-04-28 04:08:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:23,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:23,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {3738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-28 04:08:23,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 04:08:23,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3732#true} {3732#true} #68#return; {3732#true} is VALID [2022-04-28 04:08:23,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:23,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {3738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-28 04:08:23,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 04:08:23,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #68#return; {3732#true} is VALID [2022-04-28 04:08:23,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret8 := main(); {3732#true} is VALID [2022-04-28 04:08:23,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3737#(= main_~a~0 0)} is VALID [2022-04-28 04:08:23,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {3737#(= main_~a~0 0)} [96] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_404| |v_main_#t~pre7_395|)) (.cse1 (= |v_main_#t~pre5_81| |v_main_#t~pre5_80|)) (.cse2 (= v_main_~a~0_82 v_main_~a~0_81)) (.cse3 (= v_main_~c~0_220 v_main_~c~0_217)) (.cse4 (= |v_main_#t~pre4_64| |v_main_#t~pre4_63|)) (.cse5 (= |v_main_#t~pre6_155| |v_main_#t~pre6_153|)) (.cse6 (= v_main_~b~0_116 v_main_~b~0_114))) (or (and .cse0 (= v_main_~d~0_546 v_main_~d~0_557) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~d~0_557 v_main_~d~0_546)))) InVars {main_#t~pre7=|v_main_#t~pre7_404|, main_~c~0=v_main_~c~0_220, main_~d~0=v_main_~d~0_557, main_~b~0=v_main_~b~0_116, main_#t~pre4=|v_main_#t~pre4_64|, main_#t~pre5=|v_main_#t~pre5_81|, main_~a~0=v_main_~a~0_82, main_#t~pre6=|v_main_#t~pre6_155|} OutVars{main_#t~pre7=|v_main_#t~pre7_395|, main_~c~0=v_main_~c~0_217, main_~d~0=v_main_~d~0_546, main_~b~0=v_main_~b~0_114, main_#t~pre4=|v_main_#t~pre4_63|, main_#t~pre5=|v_main_#t~pre5_80|, main_~a~0=v_main_~a~0_81, main_#t~pre6=|v_main_#t~pre6_153|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3737#(= main_~a~0 0)} is VALID [2022-04-28 04:08:23,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {3737#(= main_~a~0 0)} [95] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3733#false} is VALID [2022-04-28 04:08:23,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {3733#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3733#false} is VALID [2022-04-28 04:08:23,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 04:08:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:23,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:23,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239602535] [2022-04-28 04:08:23,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239602535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:23,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:23,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:23,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:23,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305907802] [2022-04-28 04:08:23,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305907802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:23,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:23,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 04:08:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474609238] [2022-04-28 04:08:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:23,644 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 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 39 [2022-04-28 04:08:23,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:23,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:23,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:23,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 04:08:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 04:08:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-28 04:08:23,675 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:24,380 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-28 04:08:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 04:08:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 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 39 [2022-04-28 04:08:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-28 04:08:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-28 04:08:24,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2022-04-28 04:08:24,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:24,453 INFO L225 Difference]: With dead ends: 66 [2022-04-28 04:08:24,453 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 04:08:24,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:08:24,454 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 84 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:24,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 38 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:08:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 04:08:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-04-28 04:08:24,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:24,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:24,470 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:24,470 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:24,471 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 04:08:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 04:08:24,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:24,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:24,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 55 states. [2022-04-28 04:08:24,473 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 55 states. [2022-04-28 04:08:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:24,474 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 04:08:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 04:08:24,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:24,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:24,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:24,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-28 04:08:24,475 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-04-28 04:08:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:24,476 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-28 04:08:24,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:24,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-28 04:08:24,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-28 04:08:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 04:08:24,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:24,537 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:24,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 04:08:24,537 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash -113641229, now seen corresponding path program 11 times [2022-04-28 04:08:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:24,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465097579] [2022-04-28 04:08:24,805 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:24,928 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:25,033 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:25,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:25,267 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:25,382 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:25,510 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:25,510 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1740666627, now seen corresponding path program 1 times [2022-04-28 04:08:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:25,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85189497] [2022-04-28 04:08:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:25,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:25,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {4117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4111#true} is VALID [2022-04-28 04:08:25,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {4111#true} assume true; {4111#true} is VALID [2022-04-28 04:08:25,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4111#true} {4111#true} #68#return; {4111#true} is VALID [2022-04-28 04:08:25,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {4111#true} call ULTIMATE.init(); {4117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:25,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {4117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4111#true} is VALID [2022-04-28 04:08:25,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {4111#true} assume true; {4111#true} is VALID [2022-04-28 04:08:25,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4111#true} {4111#true} #68#return; {4111#true} is VALID [2022-04-28 04:08:25,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {4111#true} call #t~ret8 := main(); {4111#true} is VALID [2022-04-28 04:08:25,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {4111#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4116#(= main_~a~0 0)} is VALID [2022-04-28 04:08:25,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {4116#(= main_~a~0 0)} [98] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre7_471| |v_main_#t~pre7_461|) (= |v_main_#t~pre6_182| |v_main_#t~pre6_180|) (= v_main_~b~0_124 v_main_~b~0_122) (= v_main_~a~0_88 v_main_~a~0_87) (= |v_main_#t~pre4_69| |v_main_#t~pre4_68|) (= v_main_~d~0_646 v_main_~d~0_634) (= |v_main_#t~pre5_87| |v_main_#t~pre5_86|) (= v_main_~c~0_254 v_main_~c~0_251)) InVars {main_#t~pre7=|v_main_#t~pre7_471|, main_~c~0=v_main_~c~0_254, main_~d~0=v_main_~d~0_646, main_~b~0=v_main_~b~0_124, main_#t~pre4=|v_main_#t~pre4_69|, main_#t~pre5=|v_main_#t~pre5_87|, main_~a~0=v_main_~a~0_88, main_#t~pre6=|v_main_#t~pre6_182|} OutVars{main_#t~pre7=|v_main_#t~pre7_461|, main_~c~0=v_main_~c~0_251, main_~d~0=v_main_~d~0_634, main_~b~0=v_main_~b~0_122, main_#t~pre4=|v_main_#t~pre4_68|, main_#t~pre5=|v_main_#t~pre5_86|, main_~a~0=v_main_~a~0_87, main_#t~pre6=|v_main_#t~pre6_180|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4116#(= main_~a~0 0)} is VALID [2022-04-28 04:08:25,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {4116#(= main_~a~0 0)} [97] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4112#false} is VALID [2022-04-28 04:08:25,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {4112#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4112#false} is VALID [2022-04-28 04:08:25,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {4112#false} assume !false; {4112#false} is VALID [2022-04-28 04:08:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:25,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85189497] [2022-04-28 04:08:25,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85189497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:25,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:25,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:25,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:25,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465097579] [2022-04-28 04:08:25,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465097579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:25,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:25,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 04:08:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912675517] [2022-04-28 04:08:25,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:25,847 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 41 [2022-04-28 04:08:25,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:25,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:25,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:25,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 04:08:25,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:25,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 04:08:25,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:08:25,882 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:26,612 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-28 04:08:26,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:08:26,613 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 41 [2022-04-28 04:08:26,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 80 transitions. [2022-04-28 04:08:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 80 transitions. [2022-04-28 04:08:26,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 80 transitions. [2022-04-28 04:08:26,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:26,675 INFO L225 Difference]: With dead ends: 68 [2022-04-28 04:08:26,675 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 04:08:26,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:08:26,676 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 76 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:26,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 28 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:08:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 04:08:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2022-04-28 04:08:26,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:26,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:26,689 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:26,690 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:26,691 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-04-28 04:08:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-28 04:08:26,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:26,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:26,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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 57 states. [2022-04-28 04:08:26,692 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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 57 states. [2022-04-28 04:08:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:26,693 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-04-28 04:08:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-28 04:08:26,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:26,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:26,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:26,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-28 04:08:26,694 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2022-04-28 04:08:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:26,694 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-28 04:08:26,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:26,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-28 04:08:26,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-28 04:08:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 04:08:26,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:26,757 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:26,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 04:08:26,757 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1901216239, now seen corresponding path program 12 times [2022-04-28 04:08:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:26,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894256332] [2022-04-28 04:08:26,981 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,116 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,215 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,479 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,743 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1740728131, now seen corresponding path program 1 times [2022-04-28 04:08:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:27,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233436486] [2022-04-28 04:08:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:27,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:27,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {4511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4505#true} is VALID [2022-04-28 04:08:27,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {4505#true} assume true; {4505#true} is VALID [2022-04-28 04:08:27,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4505#true} {4505#true} #68#return; {4505#true} is VALID [2022-04-28 04:08:27,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {4505#true} call ULTIMATE.init(); {4511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:27,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {4511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4505#true} is VALID [2022-04-28 04:08:27,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {4505#true} assume true; {4505#true} is VALID [2022-04-28 04:08:27,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4505#true} {4505#true} #68#return; {4505#true} is VALID [2022-04-28 04:08:27,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {4505#true} call #t~ret8 := main(); {4505#true} is VALID [2022-04-28 04:08:27,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {4505#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4510#(= main_~a~0 0)} is VALID [2022-04-28 04:08:27,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {4510#(= main_~a~0 0)} [100] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_94 v_main_~a~0_93)) (.cse1 (= |v_main_#t~pre5_93| |v_main_#t~pre5_92|)) (.cse2 (= |v_main_#t~pre4_74| |v_main_#t~pre4_73|)) (.cse3 (= v_main_~b~0_132 v_main_~b~0_130)) (.cse4 (= v_main_~c~0_288 v_main_~c~0_285)) (.cse5 (= |v_main_#t~pre6_209| |v_main_#t~pre6_207|))) (or (and .cse0 .cse1 (= v_main_~d~0_739 v_main_~d~0_726) .cse2 .cse3 (= |v_main_#t~pre7_541| |v_main_#t~pre7_530|) .cse4 .cse5) (and (= |v_main_#t~pre7_530| |v_main_#t~pre7_541|) .cse0 .cse1 (= v_main_~d~0_726 v_main_~d~0_739) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_541|, main_~c~0=v_main_~c~0_288, main_~d~0=v_main_~d~0_739, main_~b~0=v_main_~b~0_132, main_#t~pre4=|v_main_#t~pre4_74|, main_#t~pre5=|v_main_#t~pre5_93|, main_~a~0=v_main_~a~0_94, main_#t~pre6=|v_main_#t~pre6_209|} OutVars{main_#t~pre7=|v_main_#t~pre7_530|, main_~c~0=v_main_~c~0_285, main_~d~0=v_main_~d~0_726, main_~b~0=v_main_~b~0_130, main_#t~pre4=|v_main_#t~pre4_73|, main_#t~pre5=|v_main_#t~pre5_92|, main_~a~0=v_main_~a~0_93, main_#t~pre6=|v_main_#t~pre6_207|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4510#(= main_~a~0 0)} is VALID [2022-04-28 04:08:27,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {4510#(= main_~a~0 0)} [99] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4506#false} is VALID [2022-04-28 04:08:27,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {4506#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4506#false} is VALID [2022-04-28 04:08:27,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {4506#false} assume !false; {4506#false} is VALID [2022-04-28 04:08:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:27,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:27,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233436486] [2022-04-28 04:08:27,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233436486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:27,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:27,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:28,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:28,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894256332] [2022-04-28 04:08:28,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894256332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:28,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:28,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 04:08:28,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552901973] [2022-04-28 04:08:28,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 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 43 [2022-04-28 04:08:28,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:28,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:28,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:28,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 04:08:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:28,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 04:08:28,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-28 04:08:28,147 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:29,089 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-28 04:08:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 04:08:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 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 43 [2022-04-28 04:08:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-28 04:08:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-28 04:08:29,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-28 04:08:29,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:29,158 INFO L225 Difference]: With dead ends: 72 [2022-04-28 04:08:29,158 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 04:08:29,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:08:29,158 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:29,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 18 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:08:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 04:08:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-04-28 04:08:29,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:29,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,171 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,172 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:29,173 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-28 04:08:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-04-28 04:08:29,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:29,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:29,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 61 states. [2022-04-28 04:08:29,173 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 61 states. [2022-04-28 04:08:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:29,174 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-28 04:08:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-04-28 04:08:29,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:29,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:29,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:29,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-04-28 04:08:29,176 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 43 [2022-04-28 04:08:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:29,176 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-04-28 04:08:29,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2022-04-28 04:08:29,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-04-28 04:08:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 04:08:29,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:29,255 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:29,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 04:08:29,255 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1773882449, now seen corresponding path program 13 times [2022-04-28 04:08:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:29,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [439550117] [2022-04-28 04:08:29,489 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:29,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:29,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:29,853 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:29,951 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:30,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:30,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:30,218 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1740789635, now seen corresponding path program 1 times [2022-04-28 04:08:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:30,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864345365] [2022-04-28 04:08:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:30,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4926#true} is VALID [2022-04-28 04:08:30,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {4926#true} assume true; {4926#true} is VALID [2022-04-28 04:08:30,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4926#true} {4926#true} #68#return; {4926#true} is VALID [2022-04-28 04:08:30,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {4926#true} call ULTIMATE.init(); {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:30,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4926#true} is VALID [2022-04-28 04:08:30,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {4926#true} assume true; {4926#true} is VALID [2022-04-28 04:08:30,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4926#true} {4926#true} #68#return; {4926#true} is VALID [2022-04-28 04:08:30,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {4926#true} call #t~ret8 := main(); {4926#true} is VALID [2022-04-28 04:08:30,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {4926#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4931#(= main_~a~0 0)} is VALID [2022-04-28 04:08:30,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {4931#(= main_~a~0 0)} [102] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_608| |v_main_#t~pre7_596|)) (.cse1 (= v_main_~c~0_320 v_main_~c~0_317)) (.cse2 (= v_main_~d~0_829 v_main_~d~0_815)) (.cse3 (= v_main_~a~0_100 v_main_~a~0_99)) (.cse4 (= v_main_~b~0_140 v_main_~b~0_138)) (.cse5 (= |v_main_#t~pre5_99| |v_main_#t~pre5_98|)) (.cse6 (= |v_main_#t~pre6_235| |v_main_#t~pre6_233|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre4_79| |v_main_#t~pre4_78|) .cse4 .cse5 .cse6) (and .cse0 .cse1 (= |v_main_#t~pre4_78| |v_main_#t~pre4_79|) .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_608|, main_~c~0=v_main_~c~0_320, main_~d~0=v_main_~d~0_829, main_~b~0=v_main_~b~0_140, main_#t~pre4=|v_main_#t~pre4_79|, main_#t~pre5=|v_main_#t~pre5_99|, main_~a~0=v_main_~a~0_100, main_#t~pre6=|v_main_#t~pre6_235|} OutVars{main_#t~pre7=|v_main_#t~pre7_596|, main_~c~0=v_main_~c~0_317, main_~d~0=v_main_~d~0_815, main_~b~0=v_main_~b~0_138, main_#t~pre4=|v_main_#t~pre4_78|, main_#t~pre5=|v_main_#t~pre5_98|, main_~a~0=v_main_~a~0_99, main_#t~pre6=|v_main_#t~pre6_233|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4931#(= main_~a~0 0)} is VALID [2022-04-28 04:08:30,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {4931#(= main_~a~0 0)} [101] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4927#false} is VALID [2022-04-28 04:08:30,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {4927#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4927#false} is VALID [2022-04-28 04:08:30,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {4927#false} assume !false; {4927#false} is VALID [2022-04-28 04:08:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:30,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:30,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864345365] [2022-04-28 04:08:30,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864345365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:30,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:30,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:30,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [439550117] [2022-04-28 04:08:30,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [439550117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:30,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:30,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 04:08:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027876543] [2022-04-28 04:08:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:30,645 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 45 [2022-04-28 04:08:30,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:30,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:30,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:30,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 04:08:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:30,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 04:08:30,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:08:30,680 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:31,762 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-28 04:08:31,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 04:08:31,762 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 45 [2022-04-28 04:08:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 85 transitions. [2022-04-28 04:08:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 85 transitions. [2022-04-28 04:08:31,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 85 transitions. [2022-04-28 04:08:31,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:31,833 INFO L225 Difference]: With dead ends: 73 [2022-04-28 04:08:31,833 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 04:08:31,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:08:31,834 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:31,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 53 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:08:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 04:08:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-04-28 04:08:31,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:31,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,846 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,846 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:31,849 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-28 04:08:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-28 04:08:31,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:31,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:31,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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 62 states. [2022-04-28 04:08:31,850 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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 62 states. [2022-04-28 04:08:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:31,851 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-28 04:08:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-28 04:08:31,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:31,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:31,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:31,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-04-28 04:08:31,853 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 45 [2022-04-28 04:08:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:31,853 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-04-28 04:08:31,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 53 transitions. [2022-04-28 04:08:31,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-04-28 04:08:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 04:08:31,928 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:31,928 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:31,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 04:08:31,929 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash -584953410, now seen corresponding path program 14 times [2022-04-28 04:08:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:31,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320429587] [2022-04-28 04:08:32,168 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:36,251 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:36,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:36,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:38,511 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:38,560 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:38,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:42,741 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:42,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:42,896 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:42,896 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1740851139, now seen corresponding path program 1 times [2022-04-28 04:08:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953879129] [2022-04-28 04:08:42,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:42,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {5364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5358#true} is VALID [2022-04-28 04:08:42,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-04-28 04:08:42,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5358#true} {5358#true} #68#return; {5358#true} is VALID [2022-04-28 04:08:42,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {5358#true} call ULTIMATE.init(); {5364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:42,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {5364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5358#true} is VALID [2022-04-28 04:08:42,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-04-28 04:08:42,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5358#true} {5358#true} #68#return; {5358#true} is VALID [2022-04-28 04:08:42,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {5358#true} call #t~ret8 := main(); {5358#true} is VALID [2022-04-28 04:08:42,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {5358#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {5363#(= main_~a~0 0)} is VALID [2022-04-28 04:08:42,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {5363#(= main_~a~0 0)} [104] L22-3-->L22-4_primed: Formula: (and (= v_main_~c~0_357 v_main_~c~0_353) (= v_main_~d~0_923 v_main_~d~0_908) (= |v_main_#t~pre7_675| |v_main_#t~pre7_663|) (= v_main_~a~0_106 v_main_~a~0_105) (= |v_main_#t~pre5_105| |v_main_#t~pre5_104|) (= |v_main_#t~pre4_84| |v_main_#t~pre4_83|) (= v_main_~b~0_148 v_main_~b~0_146) (= |v_main_#t~pre6_264| |v_main_#t~pre6_261|)) InVars {main_#t~pre7=|v_main_#t~pre7_675|, main_~c~0=v_main_~c~0_357, main_~d~0=v_main_~d~0_923, main_~b~0=v_main_~b~0_148, main_#t~pre4=|v_main_#t~pre4_84|, main_#t~pre5=|v_main_#t~pre5_105|, main_~a~0=v_main_~a~0_106, main_#t~pre6=|v_main_#t~pre6_264|} OutVars{main_#t~pre7=|v_main_#t~pre7_663|, main_~c~0=v_main_~c~0_353, main_~d~0=v_main_~d~0_908, main_~b~0=v_main_~b~0_146, main_#t~pre4=|v_main_#t~pre4_83|, main_#t~pre5=|v_main_#t~pre5_104|, main_~a~0=v_main_~a~0_105, main_#t~pre6=|v_main_#t~pre6_261|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5363#(= main_~a~0 0)} is VALID [2022-04-28 04:08:42,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {5363#(= main_~a~0 0)} [103] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {5359#false} is VALID [2022-04-28 04:08:42,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {5359#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {5359#false} is VALID [2022-04-28 04:08:42,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {5359#false} assume !false; {5359#false} is VALID [2022-04-28 04:08:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:42,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:42,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953879129] [2022-04-28 04:08:42,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953879129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:42,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:42,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:43,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:43,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320429587] [2022-04-28 04:08:43,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320429587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:43,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:43,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 04:08:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482151541] [2022-04-28 04:08:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:43,315 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 48 [2022-04-28 04:08:43,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:43,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:43,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:43,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 04:08:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 04:08:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:08:43,349 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:44,646 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-04-28 04:08:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 04:08:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 48 [2022-04-28 04:08:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 87 transitions. [2022-04-28 04:08:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 87 transitions. [2022-04-28 04:08:44,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 87 transitions. [2022-04-28 04:08:44,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:44,715 INFO L225 Difference]: With dead ends: 75 [2022-04-28 04:08:44,716 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 04:08:44,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:08:44,717 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 90 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:44,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 68 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 04:08:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 04:08:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2022-04-28 04:08:44,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:44,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:44,731 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:44,731 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:44,732 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-28 04:08:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-04-28 04:08:44,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:44,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:44,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 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 64 states. [2022-04-28 04:08:44,732 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 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 64 states. [2022-04-28 04:08:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:44,734 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-28 04:08:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-04-28 04:08:44,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:44,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:44,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:44,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-04-28 04:08:44,735 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 48 [2022-04-28 04:08:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:44,736 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-04-28 04:08:44,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:44,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2022-04-28 04:08:44,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-28 04:08:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:08:44,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:44,810 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:44,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 04:08:44,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash 434311196, now seen corresponding path program 15 times [2022-04-28 04:08:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:44,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374543890] [2022-04-28 04:08:45,068 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:45,217 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:49,303 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:49,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:49,457 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:49,572 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:49,723 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:49,837 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:49,837 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:49,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1740912643, now seen corresponding path program 1 times [2022-04-28 04:08:49,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:49,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990389079] [2022-04-28 04:08:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:49,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:49,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {5809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5803#true} is VALID [2022-04-28 04:08:49,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {5803#true} assume true; {5803#true} is VALID [2022-04-28 04:08:49,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5803#true} {5803#true} #68#return; {5803#true} is VALID [2022-04-28 04:08:49,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {5803#true} call ULTIMATE.init(); {5809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:49,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {5809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5803#true} is VALID [2022-04-28 04:08:49,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {5803#true} assume true; {5803#true} is VALID [2022-04-28 04:08:49,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5803#true} {5803#true} #68#return; {5803#true} is VALID [2022-04-28 04:08:49,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {5803#true} call #t~ret8 := main(); {5803#true} is VALID [2022-04-28 04:08:49,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {5803#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {5808#(= main_~a~0 0)} is VALID [2022-04-28 04:08:49,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {5808#(= main_~a~0 0)} [106] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_112 v_main_~a~0_111)) (.cse1 (= v_main_~b~0_156 v_main_~b~0_154)) (.cse2 (= v_main_~d~0_1021 v_main_~d~0_1005)) (.cse3 (= |v_main_#t~pre5_111| |v_main_#t~pre5_110|)) (.cse4 (= |v_main_#t~pre4_89| |v_main_#t~pre4_88|))) (or (and .cse0 (= |v_main_#t~pre7_740| |v_main_#t~pre7_727|) (= |v_main_#t~pre6_293| |v_main_#t~pre6_290|) .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_394 v_main_~c~0_390)) (and (= |v_main_#t~pre6_290| |v_main_#t~pre6_293|) (= |v_main_#t~pre7_727| |v_main_#t~pre7_740|) .cse0 .cse1 (= v_main_~c~0_390 v_main_~c~0_394) .cse2 .cse3 .cse4))) InVars {main_#t~pre7=|v_main_#t~pre7_740|, main_~c~0=v_main_~c~0_394, main_~d~0=v_main_~d~0_1021, main_~b~0=v_main_~b~0_156, main_#t~pre4=|v_main_#t~pre4_89|, main_#t~pre5=|v_main_#t~pre5_111|, main_~a~0=v_main_~a~0_112, main_#t~pre6=|v_main_#t~pre6_293|} OutVars{main_#t~pre7=|v_main_#t~pre7_727|, main_~c~0=v_main_~c~0_390, main_~d~0=v_main_~d~0_1005, main_~b~0=v_main_~b~0_154, main_#t~pre4=|v_main_#t~pre4_88|, main_#t~pre5=|v_main_#t~pre5_110|, main_~a~0=v_main_~a~0_111, main_#t~pre6=|v_main_#t~pre6_290|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5808#(= main_~a~0 0)} is VALID [2022-04-28 04:08:49,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {5808#(= main_~a~0 0)} [105] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {5804#false} is VALID [2022-04-28 04:08:49,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {5804#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {5804#false} is VALID [2022-04-28 04:08:49,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {5804#false} assume !false; {5804#false} is VALID [2022-04-28 04:08:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:49,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990389079] [2022-04-28 04:08:49,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990389079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:49,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:49,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:50,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:50,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374543890] [2022-04-28 04:08:50,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374543890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:50,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:50,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 04:08:50,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749024648] [2022-04-28 04:08:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 50 [2022-04-28 04:08:50,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:50,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:50,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:50,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 04:08:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:50,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 04:08:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:08:50,420 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:51,814 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-04-28 04:08:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 04:08:51,815 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 50 [2022-04-28 04:08:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 89 transitions. [2022-04-28 04:08:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 89 transitions. [2022-04-28 04:08:51,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 89 transitions. [2022-04-28 04:08:51,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:51,893 INFO L225 Difference]: With dead ends: 77 [2022-04-28 04:08:51,893 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 04:08:51,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=1551, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:08:51,894 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:51,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 53 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:08:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 04:08:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2022-04-28 04:08:51,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:51,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:51,912 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:51,913 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:51,914 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-28 04:08:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-28 04:08:51,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:51,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:51,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 66 states. [2022-04-28 04:08:51,915 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 66 states. [2022-04-28 04:08:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:51,916 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-28 04:08:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-28 04:08:51,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:51,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:51,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:51,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-04-28 04:08:51,917 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 50 [2022-04-28 04:08:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:51,918 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-04-28 04:08:51,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:51,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 56 transitions. [2022-04-28 04:08:52,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-28 04:08:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 04:08:52,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:52,002 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:52,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 04:08:52,002 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:52,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash 695054074, now seen corresponding path program 16 times [2022-04-28 04:08:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:52,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557523669] [2022-04-28 04:08:52,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:56,321 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:56,369 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:56,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:00,596 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:00,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:00,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:04,846 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:04,892 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:05,017 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:05,018 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1740974147, now seen corresponding path program 1 times [2022-04-28 04:09:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:05,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203133392] [2022-04-28 04:09:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:05,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {6269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6263#true} is VALID [2022-04-28 04:09:05,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {6263#true} assume true; {6263#true} is VALID [2022-04-28 04:09:05,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6263#true} {6263#true} #68#return; {6263#true} is VALID [2022-04-28 04:09:05,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {6263#true} call ULTIMATE.init(); {6269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:05,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {6269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6263#true} is VALID [2022-04-28 04:09:05,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {6263#true} assume true; {6263#true} is VALID [2022-04-28 04:09:05,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6263#true} {6263#true} #68#return; {6263#true} is VALID [2022-04-28 04:09:05,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {6263#true} call #t~ret8 := main(); {6263#true} is VALID [2022-04-28 04:09:05,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {6263#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {6268#(= main_~a~0 0)} is VALID [2022-04-28 04:09:05,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {6268#(= main_~a~0 0)} [108] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_813| |v_main_#t~pre7_799|)) (.cse1 (= v_main_~a~0_118 v_main_~a~0_117)) (.cse2 (= |v_main_#t~pre5_117| |v_main_#t~pre5_116|)) (.cse3 (= |v_main_#t~pre4_94| |v_main_#t~pre4_93|)) (.cse4 (= v_main_~d~0_1123 v_main_~d~0_1106)) (.cse5 (= v_main_~b~0_164 v_main_~b~0_162))) (or (and (= v_main_~c~0_427 v_main_~c~0_431) .cse0 .cse1 .cse2 (= |v_main_#t~pre6_319| |v_main_#t~pre6_322|) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= v_main_~c~0_431 v_main_~c~0_427) .cse3 (= |v_main_#t~pre6_322| |v_main_#t~pre6_319|) .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_813|, main_~c~0=v_main_~c~0_431, main_~d~0=v_main_~d~0_1123, main_~b~0=v_main_~b~0_164, main_#t~pre4=|v_main_#t~pre4_94|, main_#t~pre5=|v_main_#t~pre5_117|, main_~a~0=v_main_~a~0_118, main_#t~pre6=|v_main_#t~pre6_322|} OutVars{main_#t~pre7=|v_main_#t~pre7_799|, main_~c~0=v_main_~c~0_427, main_~d~0=v_main_~d~0_1106, main_~b~0=v_main_~b~0_162, main_#t~pre4=|v_main_#t~pre4_93|, main_#t~pre5=|v_main_#t~pre5_116|, main_~a~0=v_main_~a~0_117, main_#t~pre6=|v_main_#t~pre6_319|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6268#(= main_~a~0 0)} is VALID [2022-04-28 04:09:05,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#(= main_~a~0 0)} [107] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {6264#false} is VALID [2022-04-28 04:09:05,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {6264#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {6264#false} is VALID [2022-04-28 04:09:05,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {6264#false} assume !false; {6264#false} is VALID [2022-04-28 04:09:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:05,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203133392] [2022-04-28 04:09:05,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203133392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:05,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:05,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:05,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:05,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557523669] [2022-04-28 04:09:05,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557523669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:05,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:05,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 04:09:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907380530] [2022-04-28 04:09:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 52 [2022-04-28 04:09:05,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:05,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:05,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:05,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 04:09:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:05,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 04:09:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:09:05,554 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:06,954 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-28 04:09:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 04:09:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 52 [2022-04-28 04:09:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 91 transitions. [2022-04-28 04:09:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 91 transitions. [2022-04-28 04:09:06,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 91 transitions. [2022-04-28 04:09:07,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:07,034 INFO L225 Difference]: With dead ends: 79 [2022-04-28 04:09:07,034 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 04:09:07,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1713, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:09:07,035 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:07,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 63 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:09:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 04:09:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2022-04-28 04:09:07,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:07,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:07,050 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:07,050 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:07,051 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-28 04:09:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 04:09:07,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:07,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:07,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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 68 states. [2022-04-28 04:09:07,051 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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 68 states. [2022-04-28 04:09:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:07,053 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-28 04:09:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 04:09:07,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:07,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:07,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:07,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-28 04:09:07,054 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 52 [2022-04-28 04:09:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:07,054 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-28 04:09:07,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:07,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-28 04:09:07,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-28 04:09:07,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 04:09:07,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:07,152 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:07,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 04:09:07,153 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2134110632, now seen corresponding path program 17 times [2022-04-28 04:09:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:07,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1210670184] [2022-04-28 04:09:07,385 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:11,481 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:11,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:11,633 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:13,832 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:13,936 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:18,032 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:18,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:18,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:18,206 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1741035651, now seen corresponding path program 1 times [2022-04-28 04:09:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:18,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210284047] [2022-04-28 04:09:18,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:18,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:18,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {6744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6738#true} is VALID [2022-04-28 04:09:18,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-04-28 04:09:18,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6738#true} {6738#true} #68#return; {6738#true} is VALID [2022-04-28 04:09:18,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {6738#true} call ULTIMATE.init(); {6744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:18,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {6744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6738#true} is VALID [2022-04-28 04:09:18,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-04-28 04:09:18,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6738#true} {6738#true} #68#return; {6738#true} is VALID [2022-04-28 04:09:18,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {6738#true} call #t~ret8 := main(); {6738#true} is VALID [2022-04-28 04:09:18,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {6738#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {6743#(= main_~a~0 0)} is VALID [2022-04-28 04:09:18,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {6743#(= main_~a~0 0)} [110] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_124 v_main_~a~0_123)) (.cse1 (= |v_main_#t~pre5_123| |v_main_#t~pre5_122|)) (.cse2 (= |v_main_#t~pre6_351| |v_main_#t~pre6_348|)) (.cse3 (= |v_main_#t~pre4_99| |v_main_#t~pre4_98|)) (.cse4 (= v_main_~d~0_1229 v_main_~d~0_1211)) (.cse5 (= v_main_~c~0_468 v_main_~c~0_464))) (or (and .cse0 (= |v_main_#t~pre7_874| |v_main_#t~pre7_889|) .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~b~0_170 v_main_~b~0_172)) (and .cse0 (= v_main_~b~0_172 v_main_~b~0_170) (= |v_main_#t~pre7_889| |v_main_#t~pre7_874|) .cse1 .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_889|, main_~c~0=v_main_~c~0_468, main_~d~0=v_main_~d~0_1229, main_~b~0=v_main_~b~0_172, main_#t~pre4=|v_main_#t~pre4_99|, main_#t~pre5=|v_main_#t~pre5_123|, main_~a~0=v_main_~a~0_124, main_#t~pre6=|v_main_#t~pre6_351|} OutVars{main_#t~pre7=|v_main_#t~pre7_874|, main_~c~0=v_main_~c~0_464, main_~d~0=v_main_~d~0_1211, main_~b~0=v_main_~b~0_170, main_#t~pre4=|v_main_#t~pre4_98|, main_#t~pre5=|v_main_#t~pre5_122|, main_~a~0=v_main_~a~0_123, main_#t~pre6=|v_main_#t~pre6_348|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6743#(= main_~a~0 0)} is VALID [2022-04-28 04:09:18,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {6743#(= main_~a~0 0)} [109] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {6739#false} is VALID [2022-04-28 04:09:18,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {6739#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {6739#false} is VALID [2022-04-28 04:09:18,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {6739#false} assume !false; {6739#false} is VALID [2022-04-28 04:09:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:18,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210284047] [2022-04-28 04:09:18,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210284047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:18,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:18,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:18,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:18,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1210670184] [2022-04-28 04:09:18,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1210670184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:18,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:18,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 04:09:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785433434] [2022-04-28 04:09:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:18,767 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 54 [2022-04-28 04:09:18,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:18,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:18,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:18,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 04:09:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 04:09:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:09:18,806 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:20,273 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-04-28 04:09:20,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 04:09:20,273 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 54 [2022-04-28 04:09:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 93 transitions. [2022-04-28 04:09:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 93 transitions. [2022-04-28 04:09:20,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 93 transitions. [2022-04-28 04:09:20,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:20,371 INFO L225 Difference]: With dead ends: 81 [2022-04-28 04:09:20,371 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 04:09:20,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:09:20,372 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 112 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:20,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 43 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:09:20,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 04:09:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2022-04-28 04:09:20,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:20,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:20,396 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:20,396 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:20,397 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-04-28 04:09:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-04-28 04:09:20,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:20,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:20,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 70 states. [2022-04-28 04:09:20,398 INFO L87 Difference]: Start difference. First operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 70 states. [2022-04-28 04:09:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:20,399 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-04-28 04:09:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-04-28 04:09:20,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:20,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:20,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:20,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-04-28 04:09:20,401 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 54 [2022-04-28 04:09:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:20,401 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-04-28 04:09:20,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:20,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2022-04-28 04:09:20,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-28 04:09:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 04:09:20,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:20,502 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:20,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 04:09:20,503 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2047872566, now seen corresponding path program 18 times [2022-04-28 04:09:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:20,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661804293] [2022-04-28 04:09:20,724 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:22,821 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:22,879 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:22,983 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:27,078 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:27,136 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:27,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:29,908 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:29,960 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:30,095 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:30,095 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1741097155, now seen corresponding path program 1 times [2022-04-28 04:09:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:30,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809893216] [2022-04-28 04:09:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:30,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {7234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7228#true} is VALID [2022-04-28 04:09:30,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {7228#true} assume true; {7228#true} is VALID [2022-04-28 04:09:30,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7228#true} {7228#true} #68#return; {7228#true} is VALID [2022-04-28 04:09:30,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {7228#true} call ULTIMATE.init(); {7234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:30,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {7234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7228#true} is VALID [2022-04-28 04:09:30,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#true} assume true; {7228#true} is VALID [2022-04-28 04:09:30,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#true} {7228#true} #68#return; {7228#true} is VALID [2022-04-28 04:09:30,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {7228#true} call #t~ret8 := main(); {7228#true} is VALID [2022-04-28 04:09:30,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {7228#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {7233#(= main_~a~0 0)} is VALID [2022-04-28 04:09:30,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {7233#(= main_~a~0 0)} [112] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_129| |v_main_#t~pre5_128|)) (.cse1 (= |v_main_#t~pre4_104| |v_main_#t~pre4_103|)) (.cse2 (= |v_main_#t~pre7_968| |v_main_#t~pre7_952|)) (.cse3 (= v_main_~c~0_505 v_main_~c~0_501))) (or (and (= |v_main_#t~pre6_377| |v_main_#t~pre6_380|) (= v_main_~b~0_178 v_main_~b~0_180) .cse0 (= v_main_~d~0_1320 v_main_~d~0_1339) (= v_main_~a~0_129 v_main_~a~0_130) .cse1 .cse2 .cse3) (and (= v_main_~d~0_1339 v_main_~d~0_1320) (= v_main_~b~0_180 v_main_~b~0_178) .cse0 .cse1 (= |v_main_#t~pre6_380| |v_main_#t~pre6_377|) .cse2 .cse3 (= v_main_~a~0_130 v_main_~a~0_129)))) InVars {main_#t~pre7=|v_main_#t~pre7_968|, main_~c~0=v_main_~c~0_505, main_~d~0=v_main_~d~0_1339, main_~b~0=v_main_~b~0_180, main_#t~pre4=|v_main_#t~pre4_104|, main_#t~pre5=|v_main_#t~pre5_129|, main_~a~0=v_main_~a~0_130, main_#t~pre6=|v_main_#t~pre6_380|} OutVars{main_#t~pre7=|v_main_#t~pre7_952|, main_~c~0=v_main_~c~0_501, main_~d~0=v_main_~d~0_1320, main_~b~0=v_main_~b~0_178, main_#t~pre4=|v_main_#t~pre4_103|, main_#t~pre5=|v_main_#t~pre5_128|, main_~a~0=v_main_~a~0_129, main_#t~pre6=|v_main_#t~pre6_377|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7233#(= main_~a~0 0)} is VALID [2022-04-28 04:09:30,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {7233#(= main_~a~0 0)} [111] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {7229#false} is VALID [2022-04-28 04:09:30,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {7229#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {7229#false} is VALID [2022-04-28 04:09:30,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {7229#false} assume !false; {7229#false} is VALID [2022-04-28 04:09:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:30,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809893216] [2022-04-28 04:09:30,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809893216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:30,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:30,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:30,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:30,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661804293] [2022-04-28 04:09:30,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661804293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:30,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:30,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 04:09:30,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729974942] [2022-04-28 04:09:30,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:30,644 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 56 [2022-04-28 04:09:30,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:30,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:30,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:30,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 04:09:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 04:09:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:09:30,688 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:32,225 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-04-28 04:09:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 04:09:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 56 [2022-04-28 04:09:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-28 04:09:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-28 04:09:32,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 95 transitions. [2022-04-28 04:09:32,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:32,306 INFO L225 Difference]: With dead ends: 83 [2022-04-28 04:09:32,307 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 04:09:32,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=2061, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 04:09:32,308 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 90 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:32,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 58 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:09:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 04:09:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-04-28 04:09:32,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:32,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:32,325 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:32,325 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:32,326 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-04-28 04:09:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-04-28 04:09:32,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:32,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:32,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 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 72 states. [2022-04-28 04:09:32,327 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 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 72 states. [2022-04-28 04:09:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:32,328 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-04-28 04:09:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-04-28 04:09:32,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:32,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:32,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:32,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-04-28 04:09:32,329 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 56 [2022-04-28 04:09:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:32,329 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-04-28 04:09:32,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:32,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2022-04-28 04:09:32,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-28 04:09:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 04:09:32,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:32,425 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:32,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 04:09:32,425 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:32,426 INFO L85 PathProgramCache]: Analyzing trace with hash 844336788, now seen corresponding path program 19 times [2022-04-28 04:09:32,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:32,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634841187] [2022-04-28 04:09:32,666 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:32,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:32,990 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:37,076 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:37,121 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:37,219 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:41,304 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:41,349 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:41,473 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:41,473 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1741158659, now seen corresponding path program 1 times [2022-04-28 04:09:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:41,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230414780] [2022-04-28 04:09:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:41,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:41,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {7739#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7733#true} is VALID [2022-04-28 04:09:41,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {7733#true} assume true; {7733#true} is VALID [2022-04-28 04:09:41,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7733#true} {7733#true} #68#return; {7733#true} is VALID [2022-04-28 04:09:41,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {7733#true} call ULTIMATE.init(); {7739#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:41,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {7739#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7733#true} is VALID [2022-04-28 04:09:41,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {7733#true} assume true; {7733#true} is VALID [2022-04-28 04:09:41,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7733#true} {7733#true} #68#return; {7733#true} is VALID [2022-04-28 04:09:41,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {7733#true} call #t~ret8 := main(); {7733#true} is VALID [2022-04-28 04:09:41,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {7733#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {7738#(= main_~a~0 0)} is VALID [2022-04-28 04:09:41,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {7738#(= main_~a~0 0)} [114] L22-3-->L22-4_primed: Formula: (and (= v_main_~d~0_1453 v_main_~d~0_1433) (= v_main_~a~0_136 v_main_~a~0_135) (= |v_main_#t~pre4_109| |v_main_#t~pre4_108|) (= v_main_~c~0_542 v_main_~c~0_538) (= |v_main_#t~pre6_409| |v_main_#t~pre6_406|) (= |v_main_#t~pre5_135| |v_main_#t~pre5_134|) (= |v_main_#t~pre7_1050| |v_main_#t~pre7_1033|) (= v_main_~b~0_188 v_main_~b~0_186)) InVars {main_#t~pre7=|v_main_#t~pre7_1050|, main_~c~0=v_main_~c~0_542, main_~d~0=v_main_~d~0_1453, main_~b~0=v_main_~b~0_188, main_#t~pre4=|v_main_#t~pre4_109|, main_#t~pre5=|v_main_#t~pre5_135|, main_~a~0=v_main_~a~0_136, main_#t~pre6=|v_main_#t~pre6_409|} OutVars{main_#t~pre7=|v_main_#t~pre7_1033|, main_~c~0=v_main_~c~0_538, main_~d~0=v_main_~d~0_1433, main_~b~0=v_main_~b~0_186, main_#t~pre4=|v_main_#t~pre4_108|, main_#t~pre5=|v_main_#t~pre5_134|, main_~a~0=v_main_~a~0_135, main_#t~pre6=|v_main_#t~pre6_406|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7738#(= main_~a~0 0)} is VALID [2022-04-28 04:09:41,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {7738#(= main_~a~0 0)} [113] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {7734#false} is VALID [2022-04-28 04:09:41,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {7734#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {7734#false} is VALID [2022-04-28 04:09:41,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {7734#false} assume !false; {7734#false} is VALID [2022-04-28 04:09:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:41,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230414780] [2022-04-28 04:09:41,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230414780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:41,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:41,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:42,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:42,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634841187] [2022-04-28 04:09:42,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634841187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:42,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:42,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 04:09:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081681342] [2022-04-28 04:09:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:42,094 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 58 [2022-04-28 04:09:42,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:42,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:42,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:42,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 04:09:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 04:09:42,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:09:42,136 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:44,081 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2022-04-28 04:09:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 04:09:44,081 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 58 [2022-04-28 04:09:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 100 transitions. [2022-04-28 04:09:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 100 transitions. [2022-04-28 04:09:44,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 100 transitions. [2022-04-28 04:09:44,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:44,177 INFO L225 Difference]: With dead ends: 87 [2022-04-28 04:09:44,178 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 04:09:44,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=2247, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 04:09:44,179 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:44,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 04:09:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 04:09:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2022-04-28 04:09:44,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:44,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:44,205 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:44,205 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:44,206 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-04-28 04:09:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-28 04:09:44,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:44,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:44,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 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 76 states. [2022-04-28 04:09:44,207 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 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 76 states. [2022-04-28 04:09:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:44,208 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-04-28 04:09:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-28 04:09:44,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:44,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:44,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:44,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-04-28 04:09:44,210 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 58 [2022-04-28 04:09:44,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:44,210 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-04-28 04:09:44,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:44,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 66 transitions. [2022-04-28 04:09:44,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-28 04:09:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 04:09:44,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:44,340 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:44,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 04:09:44,340 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash -407343246, now seen corresponding path program 20 times [2022-04-28 04:09:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:44,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714671758] [2022-04-28 04:09:44,608 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:46,754 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:46,865 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:50,949 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:50,994 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:51,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:55,173 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:55,217 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:55,347 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:55,347 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:55,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1741220163, now seen corresponding path program 1 times [2022-04-28 04:09:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:55,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993372157] [2022-04-28 04:09:55,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:55,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {8271#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8265#true} is VALID [2022-04-28 04:09:55,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {8265#true} assume true; {8265#true} is VALID [2022-04-28 04:09:55,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8265#true} {8265#true} #68#return; {8265#true} is VALID [2022-04-28 04:09:55,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {8265#true} call ULTIMATE.init(); {8271#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:55,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8265#true} is VALID [2022-04-28 04:09:55,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {8265#true} assume true; {8265#true} is VALID [2022-04-28 04:09:55,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8265#true} {8265#true} #68#return; {8265#true} is VALID [2022-04-28 04:09:55,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {8265#true} call #t~ret8 := main(); {8265#true} is VALID [2022-04-28 04:09:55,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {8265#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {8270#(= main_~a~0 0)} is VALID [2022-04-28 04:09:55,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {8270#(= main_~a~0 0)} [116] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre7_1129| |v_main_#t~pre7_1111|) (= |v_main_#t~pre6_437| |v_main_#t~pre6_434|) (= v_main_~d~0_1564 v_main_~d~0_1543) (= |v_main_#t~pre4_114| |v_main_#t~pre4_113|) (= |v_main_#t~pre5_141| |v_main_#t~pre5_140|) (= v_main_~a~0_142 v_main_~a~0_141) (= v_main_~c~0_577 v_main_~c~0_573) (= v_main_~b~0_196 v_main_~b~0_194)) InVars {main_#t~pre7=|v_main_#t~pre7_1129|, main_~c~0=v_main_~c~0_577, main_~d~0=v_main_~d~0_1564, main_~b~0=v_main_~b~0_196, main_#t~pre4=|v_main_#t~pre4_114|, main_#t~pre5=|v_main_#t~pre5_141|, main_~a~0=v_main_~a~0_142, main_#t~pre6=|v_main_#t~pre6_437|} OutVars{main_#t~pre7=|v_main_#t~pre7_1111|, main_~c~0=v_main_~c~0_573, main_~d~0=v_main_~d~0_1543, main_~b~0=v_main_~b~0_194, main_#t~pre4=|v_main_#t~pre4_113|, main_#t~pre5=|v_main_#t~pre5_140|, main_~a~0=v_main_~a~0_141, main_#t~pre6=|v_main_#t~pre6_434|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8270#(= main_~a~0 0)} is VALID [2022-04-28 04:09:55,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {8270#(= main_~a~0 0)} [115] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {8266#false} is VALID [2022-04-28 04:09:55,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {8266#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {8266#false} is VALID [2022-04-28 04:09:55,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {8266#false} assume !false; {8266#false} is VALID [2022-04-28 04:09:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:55,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993372157] [2022-04-28 04:09:55,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993372157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:55,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:55,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:55,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:55,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714671758] [2022-04-28 04:09:55,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714671758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:55,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:55,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 04:09:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018755903] [2022-04-28 04:09:55,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:55,996 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 60 [2022-04-28 04:09:55,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:55,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:56,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:56,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 04:09:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 04:09:56,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-04-28 04:09:56,042 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:57,869 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2022-04-28 04:09:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 04:09:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 60 [2022-04-28 04:09:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 100 transitions. [2022-04-28 04:09:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 100 transitions. [2022-04-28 04:09:57,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 100 transitions. [2022-04-28 04:09:57,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:57,957 INFO L225 Difference]: With dead ends: 88 [2022-04-28 04:09:57,958 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 04:09:57,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 13 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=2441, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 04:09:57,959 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:57,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 04:09:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 04:09:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2022-04-28 04:09:57,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:57,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,979 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,979 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:57,980 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-04-28 04:09:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-04-28 04:09:57,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:57,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:57,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 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 77 states. [2022-04-28 04:09:57,980 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 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 77 states. [2022-04-28 04:09:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:57,982 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-04-28 04:09:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-04-28 04:09:57,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:57,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:57,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:57,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-04-28 04:09:57,984 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 60 [2022-04-28 04:09:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:57,984 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-04-28 04:09:57,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2022-04-28 04:09:58,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-28 04:09:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 04:09:58,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:58,121 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:58,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 04:09:58,121 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2010555621, now seen corresponding path program 21 times [2022-04-28 04:09:58,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:58,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1194654781] [2022-04-28 04:09:58,407 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:58,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:58,668 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:58,802 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:58,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:59,042 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:59,192 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:59,192 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1741281667, now seen corresponding path program 1 times [2022-04-28 04:09:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:59,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221617456] [2022-04-28 04:09:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:59,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {8814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8808#true} is VALID [2022-04-28 04:09:59,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {8808#true} assume true; {8808#true} is VALID [2022-04-28 04:09:59,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8808#true} {8808#true} #68#return; {8808#true} is VALID [2022-04-28 04:09:59,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {8808#true} call ULTIMATE.init(); {8814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:59,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {8814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8808#true} is VALID [2022-04-28 04:09:59,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {8808#true} assume true; {8808#true} is VALID [2022-04-28 04:09:59,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8808#true} {8808#true} #68#return; {8808#true} is VALID [2022-04-28 04:09:59,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {8808#true} call #t~ret8 := main(); {8808#true} is VALID [2022-04-28 04:09:59,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {8808#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {8813#(= main_~a~0 0)} is VALID [2022-04-28 04:09:59,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {8813#(= main_~a~0 0)} [118] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_147| |v_main_#t~pre5_146|)) (.cse1 (= |v_main_#t~pre6_468| |v_main_#t~pre6_464|)) (.cse2 (= v_main_~d~0_1679 v_main_~d~0_1657)) (.cse3 (= v_main_~a~0_148 v_main_~a~0_147)) (.cse4 (= |v_main_#t~pre7_1208| |v_main_#t~pre7_1190|)) (.cse5 (= v_main_~b~0_204 v_main_~b~0_202)) (.cse6 (= |v_main_#t~pre4_119| |v_main_#t~pre4_118|))) (or (and .cse0 (= v_main_~c~0_612 v_main_~c~0_617) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_617 v_main_~c~0_612) .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_1208|, main_~c~0=v_main_~c~0_617, main_~d~0=v_main_~d~0_1679, main_~b~0=v_main_~b~0_204, main_#t~pre4=|v_main_#t~pre4_119|, main_#t~pre5=|v_main_#t~pre5_147|, main_~a~0=v_main_~a~0_148, main_#t~pre6=|v_main_#t~pre6_468|} OutVars{main_#t~pre7=|v_main_#t~pre7_1190|, main_~c~0=v_main_~c~0_612, main_~d~0=v_main_~d~0_1657, main_~b~0=v_main_~b~0_202, main_#t~pre4=|v_main_#t~pre4_118|, main_#t~pre5=|v_main_#t~pre5_146|, main_~a~0=v_main_~a~0_147, main_#t~pre6=|v_main_#t~pre6_464|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8813#(= main_~a~0 0)} is VALID [2022-04-28 04:09:59,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {8813#(= main_~a~0 0)} [117] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {8809#false} is VALID [2022-04-28 04:09:59,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {8809#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {8809#false} is VALID [2022-04-28 04:09:59,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {8809#false} assume !false; {8809#false} is VALID [2022-04-28 04:09:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:59,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221617456] [2022-04-28 04:09:59,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221617456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:59,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:59,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:59,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:59,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1194654781] [2022-04-28 04:09:59,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1194654781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:59,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:59,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 04:09:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028139101] [2022-04-28 04:09:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:59,827 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 63 [2022-04-28 04:09:59,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:59,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:59,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:59,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 04:09:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:59,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 04:09:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:09:59,875 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:01,678 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-04-28 04:10:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 04:10:01,679 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 63 [2022-04-28 04:10:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 102 transitions. [2022-04-28 04:10:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 102 transitions. [2022-04-28 04:10:01,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 102 transitions. [2022-04-28 04:10:01,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:01,767 INFO L225 Difference]: With dead ends: 90 [2022-04-28 04:10:01,767 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 04:10:01,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=327, Invalid=2643, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 04:10:01,768 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:01,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 43 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 04:10:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 04:10:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2022-04-28 04:10:01,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:01,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:01,795 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:01,795 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:01,796 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2022-04-28 04:10:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-04-28 04:10:01,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:01,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:01,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 79 states. [2022-04-28 04:10:01,797 INFO L87 Difference]: Start difference. First operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 79 states. [2022-04-28 04:10:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:01,798 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2022-04-28 04:10:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-04-28 04:10:01,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:01,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:01,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:01,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-04-28 04:10:01,800 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 63 [2022-04-28 04:10:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:01,800 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-04-28 04:10:01,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:01,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 69 transitions. [2022-04-28 04:10:01,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-04-28 04:10:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 04:10:01,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:01,925 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:01,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 04:10:01,925 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:01,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash 525153849, now seen corresponding path program 22 times [2022-04-28 04:10:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:01,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1560604451] [2022-04-28 04:10:02,152 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:02,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:02,378 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:02,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:02,580 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:02,706 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:02,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:02,851 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:02,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1741343171, now seen corresponding path program 1 times [2022-04-28 04:10:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:02,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363761585] [2022-04-28 04:10:02,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:02,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:02,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {9370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {9364#true} is VALID [2022-04-28 04:10:02,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {9364#true} assume true; {9364#true} is VALID [2022-04-28 04:10:02,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9364#true} {9364#true} #68#return; {9364#true} is VALID [2022-04-28 04:10:02,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {9364#true} call ULTIMATE.init(); {9370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:02,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {9370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {9364#true} is VALID [2022-04-28 04:10:02,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {9364#true} assume true; {9364#true} is VALID [2022-04-28 04:10:02,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9364#true} {9364#true} #68#return; {9364#true} is VALID [2022-04-28 04:10:02,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {9364#true} call #t~ret8 := main(); {9364#true} is VALID [2022-04-28 04:10:02,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {9364#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {9369#(= main_~a~0 0)} is VALID [2022-04-28 04:10:02,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {9369#(= main_~a~0 0)} [120] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre6_499| |v_main_#t~pre6_495|) (= v_main_~d~0_1798 v_main_~d~0_1775) (= v_main_~b~0_212 v_main_~b~0_210) (= |v_main_#t~pre4_124| |v_main_#t~pre4_123|) (= v_main_~c~0_657 v_main_~c~0_652) (= |v_main_#t~pre7_1285| |v_main_#t~pre7_1266|) (= v_main_~a~0_154 v_main_~a~0_153) (= |v_main_#t~pre5_153| |v_main_#t~pre5_152|)) InVars {main_#t~pre7=|v_main_#t~pre7_1285|, main_~c~0=v_main_~c~0_657, main_~d~0=v_main_~d~0_1798, main_~b~0=v_main_~b~0_212, main_#t~pre4=|v_main_#t~pre4_124|, main_#t~pre5=|v_main_#t~pre5_153|, main_~a~0=v_main_~a~0_154, main_#t~pre6=|v_main_#t~pre6_499|} OutVars{main_#t~pre7=|v_main_#t~pre7_1266|, main_~c~0=v_main_~c~0_652, main_~d~0=v_main_~d~0_1775, main_~b~0=v_main_~b~0_210, main_#t~pre4=|v_main_#t~pre4_123|, main_#t~pre5=|v_main_#t~pre5_152|, main_~a~0=v_main_~a~0_153, main_#t~pre6=|v_main_#t~pre6_495|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9369#(= main_~a~0 0)} is VALID [2022-04-28 04:10:02,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {9369#(= main_~a~0 0)} [119] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {9365#false} is VALID [2022-04-28 04:10:02,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {9365#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {9365#false} is VALID [2022-04-28 04:10:02,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {9365#false} assume !false; {9365#false} is VALID [2022-04-28 04:10:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:02,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:02,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363761585] [2022-04-28 04:10:02,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363761585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:02,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:02,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:03,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:03,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1560604451] [2022-04-28 04:10:03,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1560604451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:03,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:03,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 04:10:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529167766] [2022-04-28 04:10:03,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:03,551 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 65 [2022-04-28 04:10:03,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:03,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:03,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:03,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 04:10:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:03,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 04:10:03,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-04-28 04:10:03,598 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:05,785 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 04:10:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 04:10:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 65 [2022-04-28 04:10:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 104 transitions. [2022-04-28 04:10:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 104 transitions. [2022-04-28 04:10:05,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 104 transitions. [2022-04-28 04:10:05,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:05,892 INFO L225 Difference]: With dead ends: 92 [2022-04-28 04:10:05,892 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 04:10:05,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=2853, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 04:10:05,894 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 106 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:05,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 43 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 04:10:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 04:10:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-04-28 04:10:05,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:05,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,925 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,925 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:05,926 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-04-28 04:10:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-04-28 04:10:05,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:05,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:05,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 81 states. [2022-04-28 04:10:05,927 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 81 states. [2022-04-28 04:10:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:05,928 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-04-28 04:10:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-04-28 04:10:05,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:05,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:05,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:05,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-28 04:10:05,929 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 65 [2022-04-28 04:10:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:05,930 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-28 04:10:05,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 71 transitions. [2022-04-28 04:10:06,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-28 04:10:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 04:10:06,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:06,078 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:06,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 04:10:06,078 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2095497687, now seen corresponding path program 23 times [2022-04-28 04:10:06,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:06,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988037757] [2022-04-28 04:10:06,360 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:10,462 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:10,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:10,624 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:14,722 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:14,767 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:14,866 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:18,948 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:18,995 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:19,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:19,145 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1741404675, now seen corresponding path program 1 times [2022-04-28 04:10:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:19,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664962393] [2022-04-28 04:10:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:19,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:19,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {9941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {9935#true} is VALID [2022-04-28 04:10:19,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {9935#true} assume true; {9935#true} is VALID [2022-04-28 04:10:19,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9935#true} {9935#true} #68#return; {9935#true} is VALID [2022-04-28 04:10:19,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {9935#true} call ULTIMATE.init(); {9941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:19,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {9941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {9935#true} is VALID [2022-04-28 04:10:19,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {9935#true} assume true; {9935#true} is VALID [2022-04-28 04:10:19,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9935#true} {9935#true} #68#return; {9935#true} is VALID [2022-04-28 04:10:19,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {9935#true} call #t~ret8 := main(); {9935#true} is VALID [2022-04-28 04:10:19,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {9935#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {9940#(= main_~a~0 0)} is VALID [2022-04-28 04:10:19,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {9940#(= main_~a~0 0)} [122] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_159| |v_main_#t~pre5_158|)) (.cse1 (= v_main_~c~0_697 v_main_~c~0_692)) (.cse2 (= |v_main_#t~pre4_129| |v_main_#t~pre4_128|)) (.cse3 (= v_main_~d~0_1921 v_main_~d~0_1897)) (.cse4 (= |v_main_#t~pre6_530| |v_main_#t~pre6_526|)) (.cse5 (= |v_main_#t~pre7_1370| |v_main_#t~pre7_1350|)) (.cse6 (= v_main_~b~0_220 v_main_~b~0_218))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_160 v_main_~a~0_159) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_159 v_main_~a~0_160) .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_1370|, main_~c~0=v_main_~c~0_697, main_~d~0=v_main_~d~0_1921, main_~b~0=v_main_~b~0_220, main_#t~pre4=|v_main_#t~pre4_129|, main_#t~pre5=|v_main_#t~pre5_159|, main_~a~0=v_main_~a~0_160, main_#t~pre6=|v_main_#t~pre6_530|} OutVars{main_#t~pre7=|v_main_#t~pre7_1350|, main_~c~0=v_main_~c~0_692, main_~d~0=v_main_~d~0_1897, main_~b~0=v_main_~b~0_218, main_#t~pre4=|v_main_#t~pre4_128|, main_#t~pre5=|v_main_#t~pre5_158|, main_~a~0=v_main_~a~0_159, main_#t~pre6=|v_main_#t~pre6_526|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9940#(= main_~a~0 0)} is VALID [2022-04-28 04:10:19,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {9940#(= main_~a~0 0)} [121] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {9936#false} is VALID [2022-04-28 04:10:19,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {9936#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {9936#false} is VALID [2022-04-28 04:10:19,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {9936#false} assume !false; {9936#false} is VALID [2022-04-28 04:10:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:19,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:19,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664962393] [2022-04-28 04:10:19,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664962393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:19,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:19,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:19,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:19,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1988037757] [2022-04-28 04:10:19,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1988037757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:19,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:19,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 04:10:19,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271571951] [2022-04-28 04:10:19,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:19,921 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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 67 [2022-04-28 04:10:19,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:19,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:19,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:19,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 04:10:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 04:10:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:10:19,969 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:22,343 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-28 04:10:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 04:10:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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 67 [2022-04-28 04:10:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 106 transitions. [2022-04-28 04:10:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 106 transitions. [2022-04-28 04:10:22,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 106 transitions. [2022-04-28 04:10:22,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:22,431 INFO L225 Difference]: With dead ends: 94 [2022-04-28 04:10:22,431 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 04:10:22,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=3071, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 04:10:22,432 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 108 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:22,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 63 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 04:10:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 04:10:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2022-04-28 04:10:22,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:22,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:22,465 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:22,465 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:22,466 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 04:10:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 04:10:22,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:22,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:22,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 83 states. [2022-04-28 04:10:22,467 INFO L87 Difference]: Start difference. First operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 83 states. [2022-04-28 04:10:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:22,468 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 04:10:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 04:10:22,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:22,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:22,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:22,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 04:10:22,470 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 67 [2022-04-28 04:10:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:22,470 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 04:10:22,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:22,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 04:10:22,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 04:10:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 04:10:22,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:22,625 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:22,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 04:10:22,625 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -632562187, now seen corresponding path program 24 times [2022-04-28 04:10:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:22,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [633691327] [2022-04-28 04:10:22,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,065 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,187 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,363 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,490 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,830 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,831 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1741466179, now seen corresponding path program 1 times [2022-04-28 04:10:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:23,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245181414] [2022-04-28 04:10:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:23,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:23,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {10527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10521#true} is VALID [2022-04-28 04:10:23,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {10521#true} assume true; {10521#true} is VALID [2022-04-28 04:10:23,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10521#true} {10521#true} #68#return; {10521#true} is VALID [2022-04-28 04:10:23,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {10521#true} call ULTIMATE.init(); {10527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:23,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {10527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10521#true} is VALID [2022-04-28 04:10:23,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {10521#true} assume true; {10521#true} is VALID [2022-04-28 04:10:23,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10521#true} {10521#true} #68#return; {10521#true} is VALID [2022-04-28 04:10:23,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {10521#true} call #t~ret8 := main(); {10521#true} is VALID [2022-04-28 04:10:23,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {10521#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {10526#(= main_~a~0 0)} is VALID [2022-04-28 04:10:23,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {10526#(= main_~a~0 0)} [124] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_165| |v_main_#t~pre5_164|)) (.cse1 (= v_main_~d~0_2048 v_main_~d~0_2023)) (.cse2 (= v_main_~a~0_166 v_main_~a~0_165)) (.cse3 (= v_main_~b~0_228 v_main_~b~0_226)) (.cse4 (= |v_main_#t~pre4_134| |v_main_#t~pre4_133|)) (.cse5 (= |v_main_#t~pre7_1458| |v_main_#t~pre7_1437|))) (or (and (= v_main_~c~0_732 v_main_~c~0_737) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_557| |v_main_#t~pre6_561|) .cse5) (and (= v_main_~c~0_737 v_main_~c~0_732) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre6_561| |v_main_#t~pre6_557|)))) InVars {main_#t~pre7=|v_main_#t~pre7_1458|, main_~c~0=v_main_~c~0_737, main_~d~0=v_main_~d~0_2048, main_~b~0=v_main_~b~0_228, main_#t~pre4=|v_main_#t~pre4_134|, main_#t~pre5=|v_main_#t~pre5_165|, main_~a~0=v_main_~a~0_166, main_#t~pre6=|v_main_#t~pre6_561|} OutVars{main_#t~pre7=|v_main_#t~pre7_1437|, main_~c~0=v_main_~c~0_732, main_~d~0=v_main_~d~0_2023, main_~b~0=v_main_~b~0_226, main_#t~pre4=|v_main_#t~pre4_133|, main_#t~pre5=|v_main_#t~pre5_164|, main_~a~0=v_main_~a~0_165, main_#t~pre6=|v_main_#t~pre6_557|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10526#(= main_~a~0 0)} is VALID [2022-04-28 04:10:23,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {10526#(= main_~a~0 0)} [123] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {10522#false} is VALID [2022-04-28 04:10:23,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {10522#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {10522#false} is VALID [2022-04-28 04:10:23,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {10522#false} assume !false; {10522#false} is VALID [2022-04-28 04:10:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:23,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245181414] [2022-04-28 04:10:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245181414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:23,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:23,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:24,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:24,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [633691327] [2022-04-28 04:10:24,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [633691327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:24,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:24,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 04:10:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939774734] [2022-04-28 04:10:24,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:24,667 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 69 [2022-04-28 04:10:24,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:24,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:24,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:24,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 04:10:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:24,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 04:10:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2022-04-28 04:10:24,719 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,296 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-04-28 04:10:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 04:10:27,297 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 69 [2022-04-28 04:10:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 108 transitions. [2022-04-28 04:10:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 108 transitions. [2022-04-28 04:10:27,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 108 transitions. [2022-04-28 04:10:27,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:27,395 INFO L225 Difference]: With dead ends: 96 [2022-04-28 04:10:27,396 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 04:10:27,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 17 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=363, Invalid=3297, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 04:10:27,397 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 110 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:27,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 78 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 04:10:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 04:10:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-04-28 04:10:27,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:27,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,422 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,422 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,423 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-28 04:10:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-28 04:10:27,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:27,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:27,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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 85 states. [2022-04-28 04:10:27,424 INFO L87 Difference]: Start difference. First operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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 85 states. [2022-04-28 04:10:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,425 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-28 04:10:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-28 04:10:27,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:27,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:27,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:27,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-04-28 04:10:27,426 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 69 [2022-04-28 04:10:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:27,426 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-04-28 04:10:27,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 75 transitions. [2022-04-28 04:10:27,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-04-28 04:10:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 04:10:27,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:27,562 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:27,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 04:10:27,562 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:27,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1926916755, now seen corresponding path program 25 times [2022-04-28 04:10:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:27,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [492799358] [2022-04-28 04:10:27,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:31,191 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:31,242 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:31,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:34,339 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:34,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:34,488 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:37,604 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:37,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:37,811 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:37,811 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1741527683, now seen corresponding path program 1 times [2022-04-28 04:10:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:37,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005654554] [2022-04-28 04:10:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:37,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {11128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11122#true} is VALID [2022-04-28 04:10:37,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {11122#true} assume true; {11122#true} is VALID [2022-04-28 04:10:37,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11122#true} {11122#true} #68#return; {11122#true} is VALID [2022-04-28 04:10:37,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {11122#true} call ULTIMATE.init(); {11128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:37,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {11128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11122#true} is VALID [2022-04-28 04:10:37,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {11122#true} assume true; {11122#true} is VALID [2022-04-28 04:10:37,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11122#true} {11122#true} #68#return; {11122#true} is VALID [2022-04-28 04:10:37,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {11122#true} call #t~ret8 := main(); {11122#true} is VALID [2022-04-28 04:10:37,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {11122#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {11127#(= main_~a~0 0)} is VALID [2022-04-28 04:10:37,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {11127#(= main_~a~0 0)} [126] L22-3-->L22-4_primed: Formula: (and (= v_main_~d~0_2179 v_main_~d~0_2153) (= |v_main_#t~pre4_139| |v_main_#t~pre4_138|) (= |v_main_#t~pre7_1549| |v_main_#t~pre7_1527|) (= v_main_~b~0_236 v_main_~b~0_234) (= v_main_~c~0_777 v_main_~c~0_772) (= v_main_~a~0_172 v_main_~a~0_171) (= |v_main_#t~pre6_592| |v_main_#t~pre6_588|) (= |v_main_#t~pre5_171| |v_main_#t~pre5_170|)) InVars {main_#t~pre7=|v_main_#t~pre7_1549|, main_~c~0=v_main_~c~0_777, main_~d~0=v_main_~d~0_2179, main_~b~0=v_main_~b~0_236, main_#t~pre4=|v_main_#t~pre4_139|, main_#t~pre5=|v_main_#t~pre5_171|, main_~a~0=v_main_~a~0_172, main_#t~pre6=|v_main_#t~pre6_592|} OutVars{main_#t~pre7=|v_main_#t~pre7_1527|, main_~c~0=v_main_~c~0_772, main_~d~0=v_main_~d~0_2153, main_~b~0=v_main_~b~0_234, main_#t~pre4=|v_main_#t~pre4_138|, main_#t~pre5=|v_main_#t~pre5_170|, main_~a~0=v_main_~a~0_171, main_#t~pre6=|v_main_#t~pre6_588|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11127#(= main_~a~0 0)} is VALID [2022-04-28 04:10:37,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {11127#(= main_~a~0 0)} [125] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {11123#false} is VALID [2022-04-28 04:10:37,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {11123#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {11123#false} is VALID [2022-04-28 04:10:37,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {11123#false} assume !false; {11123#false} is VALID [2022-04-28 04:10:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:37,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:37,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005654554] [2022-04-28 04:10:37,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005654554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:37,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:37,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:38,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:38,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [492799358] [2022-04-28 04:10:38,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [492799358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:38,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:38,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 04:10:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397962786] [2022-04-28 04:10:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:38,681 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 71 [2022-04-28 04:10:38,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:38,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:38,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 04:10:38,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:38,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 04:10:38,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:10:38,742 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:41,619 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-04-28 04:10:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 04:10:41,620 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 71 [2022-04-28 04:10:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-28 04:10:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-28 04:10:41,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 110 transitions. [2022-04-28 04:10:41,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:41,734 INFO L225 Difference]: With dead ends: 98 [2022-04-28 04:10:41,734 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 04:10:41,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=375, Invalid=3531, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 04:10:41,736 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 112 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:41,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 93 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 04:10:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 04:10:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-04-28 04:10:41,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:41,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:41,771 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:41,771 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:41,773 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-04-28 04:10:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-04-28 04:10:41,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:41,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:41,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 87 states. [2022-04-28 04:10:41,773 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 87 states. [2022-04-28 04:10:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:41,775 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-04-28 04:10:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-04-28 04:10:41,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:41,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:41,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:41,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-28 04:10:41,777 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 71 [2022-04-28 04:10:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:41,777 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-28 04:10:41,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:41,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 77 transitions. [2022-04-28 04:10:41,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-28 04:10:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 04:10:41,950 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:41,950 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:41,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 04:10:41,950 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:41,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash 569919409, now seen corresponding path program 26 times [2022-04-28 04:10:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:41,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442985876] [2022-04-28 04:10:42,221 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:42,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:42,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:42,592 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:42,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:42,818 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:42,971 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:42,971 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1741589187, now seen corresponding path program 1 times [2022-04-28 04:10:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:42,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526216448] [2022-04-28 04:10:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:43,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:43,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {11744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11738#true} is VALID [2022-04-28 04:10:43,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-28 04:10:43,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11738#true} {11738#true} #68#return; {11738#true} is VALID [2022-04-28 04:10:43,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {11738#true} call ULTIMATE.init(); {11744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:43,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {11744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11738#true} is VALID [2022-04-28 04:10:43,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-28 04:10:43,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11738#true} {11738#true} #68#return; {11738#true} is VALID [2022-04-28 04:10:43,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {11738#true} call #t~ret8 := main(); {11738#true} is VALID [2022-04-28 04:10:43,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {11738#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {11743#(= main_~a~0 0)} is VALID [2022-04-28 04:10:43,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {11743#(= main_~a~0 0)} [128] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_177| |v_main_#t~pre5_176|)) (.cse1 (= v_main_~a~0_178 v_main_~a~0_177)) (.cse2 (= |v_main_#t~pre7_1643| |v_main_#t~pre7_1620|)) (.cse3 (= v_main_~d~0_2314 v_main_~d~0_2287)) (.cse4 (= v_main_~b~0_244 v_main_~b~0_242)) (.cse5 (= |v_main_#t~pre4_144| |v_main_#t~pre4_143|))) (or (and .cse0 .cse1 (= |v_main_#t~pre6_619| |v_main_#t~pre6_623|) .cse2 .cse3 .cse4 (= v_main_~c~0_812 v_main_~c~0_817) .cse5) (and .cse0 (= v_main_~c~0_817 v_main_~c~0_812) .cse1 .cse2 (= |v_main_#t~pre6_623| |v_main_#t~pre6_619|) .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_1643|, main_~c~0=v_main_~c~0_817, main_~d~0=v_main_~d~0_2314, main_~b~0=v_main_~b~0_244, main_#t~pre4=|v_main_#t~pre4_144|, main_#t~pre5=|v_main_#t~pre5_177|, main_~a~0=v_main_~a~0_178, main_#t~pre6=|v_main_#t~pre6_623|} OutVars{main_#t~pre7=|v_main_#t~pre7_1620|, main_~c~0=v_main_~c~0_812, main_~d~0=v_main_~d~0_2287, main_~b~0=v_main_~b~0_242, main_#t~pre4=|v_main_#t~pre4_143|, main_#t~pre5=|v_main_#t~pre5_176|, main_~a~0=v_main_~a~0_177, main_#t~pre6=|v_main_#t~pre6_619|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11743#(= main_~a~0 0)} is VALID [2022-04-28 04:10:43,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {11743#(= main_~a~0 0)} [127] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {11739#false} is VALID [2022-04-28 04:10:43,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {11739#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {11739#false} is VALID [2022-04-28 04:10:43,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {11739#false} assume !false; {11739#false} is VALID [2022-04-28 04:10:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:43,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:43,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526216448] [2022-04-28 04:10:43,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526216448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:43,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:43,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:43,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:43,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442985876] [2022-04-28 04:10:43,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442985876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:43,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:43,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 04:10:43,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463989483] [2022-04-28 04:10:43,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:43,873 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 73 [2022-04-28 04:10:43,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:43,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:43,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:43,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 04:10:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 04:10:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 04:10:43,924 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:46,709 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-04-28 04:10:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 04:10:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 73 [2022-04-28 04:10:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 115 transitions. [2022-04-28 04:10:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 115 transitions. [2022-04-28 04:10:46,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 115 transitions. [2022-04-28 04:10:46,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:46,796 INFO L225 Difference]: With dead ends: 102 [2022-04-28 04:10:46,797 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 04:10:46,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 15 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=387, Invalid=3773, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 04:10:46,798 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 108 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:46,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 04:10:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 04:10:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2022-04-28 04:10:46,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:46,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:46,825 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:46,825 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:46,826 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-28 04:10:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-04-28 04:10:46,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:46,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:46,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 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 91 states. [2022-04-28 04:10:46,827 INFO L87 Difference]: Start difference. First operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 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 91 states. [2022-04-28 04:10:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:46,828 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-28 04:10:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-04-28 04:10:46,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:46,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:46,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:46,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 04:10:46,830 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 73 [2022-04-28 04:10:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:46,830 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 04:10:46,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:46,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 04:10:46,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 04:10:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 04:10:46,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:46,978 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:46,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 04:10:46,978 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2129439409, now seen corresponding path program 27 times [2022-04-28 04:10:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:46,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971102138] [2022-04-28 04:10:47,196 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:47,317 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:47,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:47,528 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:47,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:47,739 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:47,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:47,902 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1741650691, now seen corresponding path program 1 times [2022-04-28 04:10:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:47,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656276325] [2022-04-28 04:10:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:47,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {12387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {12381#true} is VALID [2022-04-28 04:10:47,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-28 04:10:47,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12381#true} {12381#true} #68#return; {12381#true} is VALID [2022-04-28 04:10:47,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {12381#true} call ULTIMATE.init(); {12387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:47,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {12387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {12381#true} is VALID [2022-04-28 04:10:47,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-28 04:10:47,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12381#true} {12381#true} #68#return; {12381#true} is VALID [2022-04-28 04:10:47,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {12381#true} call #t~ret8 := main(); {12381#true} is VALID [2022-04-28 04:10:47,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {12381#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {12386#(= main_~a~0 0)} is VALID [2022-04-28 04:10:47,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {12386#(= main_~a~0 0)} [130] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre5_183| |v_main_#t~pre5_182|) (= v_main_~d~0_2446 v_main_~d~0_2418) (= v_main_~b~0_252 v_main_~b~0_250) (= v_main_~a~0_184 v_main_~a~0_183) (= v_main_~c~0_855 v_main_~c~0_850) (= |v_main_#t~pre6_653| |v_main_#t~pre6_649|) (= |v_main_#t~pre7_1734| |v_main_#t~pre7_1710|) (= |v_main_#t~pre4_149| |v_main_#t~pre4_148|)) InVars {main_#t~pre7=|v_main_#t~pre7_1734|, main_~c~0=v_main_~c~0_855, main_~d~0=v_main_~d~0_2446, main_~b~0=v_main_~b~0_252, main_#t~pre4=|v_main_#t~pre4_149|, main_#t~pre5=|v_main_#t~pre5_183|, main_~a~0=v_main_~a~0_184, main_#t~pre6=|v_main_#t~pre6_653|} OutVars{main_#t~pre7=|v_main_#t~pre7_1710|, main_~c~0=v_main_~c~0_850, main_~d~0=v_main_~d~0_2418, main_~b~0=v_main_~b~0_250, main_#t~pre4=|v_main_#t~pre4_148|, main_#t~pre5=|v_main_#t~pre5_182|, main_~a~0=v_main_~a~0_183, main_#t~pre6=|v_main_#t~pre6_649|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12386#(= main_~a~0 0)} is VALID [2022-04-28 04:10:47,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {12386#(= main_~a~0 0)} [129] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {12382#false} is VALID [2022-04-28 04:10:47,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {12382#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {12382#false} is VALID [2022-04-28 04:10:47,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {12382#false} assume !false; {12382#false} is VALID [2022-04-28 04:10:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:47,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:47,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656276325] [2022-04-28 04:10:47,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656276325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:47,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:47,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:48,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:48,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971102138] [2022-04-28 04:10:48,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971102138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:48,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:48,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 04:10:48,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471604017] [2022-04-28 04:10:48,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:48,831 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 75 [2022-04-28 04:10:48,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:48,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:48,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 04:10:48,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:48,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 04:10:48,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:10:48,884 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:51,821 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-04-28 04:10:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 04:10:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 75 [2022-04-28 04:10:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 115 transitions. [2022-04-28 04:10:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 115 transitions. [2022-04-28 04:10:51,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 115 transitions. [2022-04-28 04:10:51,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:51,910 INFO L225 Difference]: With dead ends: 103 [2022-04-28 04:10:51,910 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 04:10:51,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 16 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=399, Invalid=4023, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 04:10:51,911 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 151 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:51,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 33 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 04:10:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 04:10:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-04-28 04:10:51,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:51,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:51,945 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:51,945 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:51,946 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-04-28 04:10:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-04-28 04:10:51,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:51,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:51,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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 92 states. [2022-04-28 04:10:51,947 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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 92 states. [2022-04-28 04:10:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:51,948 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-04-28 04:10:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-04-28 04:10:51,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:51,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:51,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:51,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-28 04:10:51,950 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 75 [2022-04-28 04:10:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:51,950 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-28 04:10:51,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:51,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 83 transitions. [2022-04-28 04:10:52,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-28 04:10:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 04:10:52,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:52,111 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:52,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 04:10:52,112 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:52,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1592996834, now seen corresponding path program 28 times [2022-04-28 04:10:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:52,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135605725] [2022-04-28 04:10:52,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,682 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:53,046 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:53,047 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1741712195, now seen corresponding path program 1 times [2022-04-28 04:10:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:53,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653756854] [2022-04-28 04:10:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:53,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:53,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {13041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13035#true} is VALID [2022-04-28 04:10:53,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {13035#true} assume true; {13035#true} is VALID [2022-04-28 04:10:53,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13035#true} {13035#true} #68#return; {13035#true} is VALID [2022-04-28 04:10:53,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {13035#true} call ULTIMATE.init(); {13041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:53,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {13041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13035#true} is VALID [2022-04-28 04:10:53,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {13035#true} assume true; {13035#true} is VALID [2022-04-28 04:10:53,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13035#true} {13035#true} #68#return; {13035#true} is VALID [2022-04-28 04:10:53,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {13035#true} call #t~ret8 := main(); {13035#true} is VALID [2022-04-28 04:10:53,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {13035#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {13040#(= main_~a~0 0)} is VALID [2022-04-28 04:10:53,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {13040#(= main_~a~0 0)} [132] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_260 v_main_~b~0_258)) (.cse1 (= v_main_~c~0_898 v_main_~c~0_892)) (.cse2 (= |v_main_#t~pre6_686| |v_main_#t~pre6_681|)) (.cse3 (= |v_main_#t~pre7_1825| |v_main_#t~pre7_1801|)) (.cse4 (= |v_main_#t~pre5_189| |v_main_#t~pre5_188|)) (.cse5 (= |v_main_#t~pre4_154| |v_main_#t~pre4_153|)) (.cse6 (= v_main_~d~0_2582 v_main_~d~0_2553))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~a~0_190 v_main_~a~0_189) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_189 v_main_~a~0_190) .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_1825|, main_~c~0=v_main_~c~0_898, main_~d~0=v_main_~d~0_2582, main_~b~0=v_main_~b~0_260, main_#t~pre4=|v_main_#t~pre4_154|, main_#t~pre5=|v_main_#t~pre5_189|, main_~a~0=v_main_~a~0_190, main_#t~pre6=|v_main_#t~pre6_686|} OutVars{main_#t~pre7=|v_main_#t~pre7_1801|, main_~c~0=v_main_~c~0_892, main_~d~0=v_main_~d~0_2553, main_~b~0=v_main_~b~0_258, main_#t~pre4=|v_main_#t~pre4_153|, main_#t~pre5=|v_main_#t~pre5_188|, main_~a~0=v_main_~a~0_189, main_#t~pre6=|v_main_#t~pre6_681|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13040#(= main_~a~0 0)} is VALID [2022-04-28 04:10:53,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {13040#(= main_~a~0 0)} [131] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {13036#false} is VALID [2022-04-28 04:10:53,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {13036#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {13036#false} is VALID [2022-04-28 04:10:53,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {13036#false} assume !false; {13036#false} is VALID [2022-04-28 04:10:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:53,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653756854] [2022-04-28 04:10:53,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653756854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:53,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:53,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:54,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:54,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135605725] [2022-04-28 04:10:54,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135605725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:54,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:54,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 04:10:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697126539] [2022-04-28 04:10:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:54,055 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 78 [2022-04-28 04:10:54,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:54,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:54,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:54,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 04:10:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:54,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 04:10:54,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 04:10:54,127 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:57,085 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-04-28 04:10:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 04:10:57,085 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 78 [2022-04-28 04:10:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 117 transitions. [2022-04-28 04:10:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 117 transitions. [2022-04-28 04:10:57,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 117 transitions. [2022-04-28 04:10:57,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:57,178 INFO L225 Difference]: With dead ends: 105 [2022-04-28 04:10:57,178 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 04:10:57,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 30 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=4281, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 04:10:57,179 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:57,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 18 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 04:10:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 04:10:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2022-04-28 04:10:57,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:57,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:57,208 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:57,208 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:57,209 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-28 04:10:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-28 04:10:57,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:57,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:57,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 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 94 states. [2022-04-28 04:10:57,210 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 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 94 states. [2022-04-28 04:10:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:57,211 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-28 04:10:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-28 04:10:57,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:57,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:57,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:57,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-04-28 04:10:57,213 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 78 [2022-04-28 04:10:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:57,213 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-04-28 04:10:57,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:57,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 84 transitions. [2022-04-28 04:10:57,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-28 04:10:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 04:10:57,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:57,381 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:57,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 04:10:57,382 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1927777668, now seen corresponding path program 29 times [2022-04-28 04:10:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:57,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542605425] [2022-04-28 04:10:57,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:01,708 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:01,753 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:05,826 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:05,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:05,964 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:06,072 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:10,153 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:10,198 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:10,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:10,373 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1741773699, now seen corresponding path program 1 times [2022-04-28 04:11:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:10,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237650855] [2022-04-28 04:11:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:10,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13702#true} is VALID [2022-04-28 04:11:10,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-28 04:11:10,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13702#true} {13702#true} #68#return; {13702#true} is VALID [2022-04-28 04:11:10,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {13702#true} call ULTIMATE.init(); {13708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:10,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13702#true} is VALID [2022-04-28 04:11:10,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-28 04:11:10,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13702#true} {13702#true} #68#return; {13702#true} is VALID [2022-04-28 04:11:10,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {13702#true} call #t~ret8 := main(); {13702#true} is VALID [2022-04-28 04:11:10,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {13702#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {13707#(= main_~a~0 0)} is VALID [2022-04-28 04:11:10,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {13707#(= main_~a~0 0)} [134] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_2722 v_main_~d~0_2692)) (.cse1 (= |v_main_#t~pre7_1914| |v_main_#t~pre7_1889|)) (.cse2 (= |v_main_#t~pre4_159| |v_main_#t~pre4_158|)) (.cse3 (= v_main_~b~0_268 v_main_~b~0_266)) (.cse4 (= v_main_~c~0_941 v_main_~c~0_935)) (.cse5 (= v_main_~a~0_196 v_main_~a~0_195))) (or (and .cse0 (= |v_main_#t~pre6_719| |v_main_#t~pre6_714|) (= |v_main_#t~pre5_195| |v_main_#t~pre5_194|) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |v_main_#t~pre6_714| |v_main_#t~pre6_719|) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre5_194| |v_main_#t~pre5_195|)))) InVars {main_#t~pre7=|v_main_#t~pre7_1914|, main_~c~0=v_main_~c~0_941, main_~d~0=v_main_~d~0_2722, main_~b~0=v_main_~b~0_268, main_#t~pre4=|v_main_#t~pre4_159|, main_#t~pre5=|v_main_#t~pre5_195|, main_~a~0=v_main_~a~0_196, main_#t~pre6=|v_main_#t~pre6_719|} OutVars{main_#t~pre7=|v_main_#t~pre7_1889|, main_~c~0=v_main_~c~0_935, main_~d~0=v_main_~d~0_2692, main_~b~0=v_main_~b~0_266, main_#t~pre4=|v_main_#t~pre4_158|, main_#t~pre5=|v_main_#t~pre5_194|, main_~a~0=v_main_~a~0_195, main_#t~pre6=|v_main_#t~pre6_714|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13707#(= main_~a~0 0)} is VALID [2022-04-28 04:11:10,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {13707#(= main_~a~0 0)} [133] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {13703#false} is VALID [2022-04-28 04:11:10,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {13703#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {13703#false} is VALID [2022-04-28 04:11:10,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-28 04:11:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:10,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237650855] [2022-04-28 04:11:10,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237650855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:10,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:10,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:11,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:11,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542605425] [2022-04-28 04:11:11,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542605425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:11,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:11,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 04:11:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035808972] [2022-04-28 04:11:11,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:11,384 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 80 [2022-04-28 04:11:11,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:11,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:11,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:11,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 04:11:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 04:11:11,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:11:11,439 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:14,626 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-04-28 04:11:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 04:11:14,626 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 80 [2022-04-28 04:11:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 119 transitions. [2022-04-28 04:11:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 119 transitions. [2022-04-28 04:11:14,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 119 transitions. [2022-04-28 04:11:14,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:14,717 INFO L225 Difference]: With dead ends: 107 [2022-04-28 04:11:14,717 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 04:11:14,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 33 SyntacticMatches, 13 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=423, Invalid=4547, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 04:11:14,718 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 111 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:14,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 68 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 04:11:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 04:11:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2022-04-28 04:11:14,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:14,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:14,753 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:14,753 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:14,754 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 04:11:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 04:11:14,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:14,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:14,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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 96 states. [2022-04-28 04:11:14,755 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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 96 states. [2022-04-28 04:11:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:14,756 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 04:11:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-28 04:11:14,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:14,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:14,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:14,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-04-28 04:11:14,758 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 80 [2022-04-28 04:11:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:14,758 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-04-28 04:11:14,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:14,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 86 transitions. [2022-04-28 04:11:14,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-28 04:11:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 04:11:14,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:14,927 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:14,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 04:11:14,927 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1529611942, now seen corresponding path program 30 times [2022-04-28 04:11:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:14,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [792219499] [2022-04-28 04:11:15,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:15,271 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:15,377 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:15,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:15,602 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:15,716 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:15,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:15,873 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:15,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1741835203, now seen corresponding path program 1 times [2022-04-28 04:11:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:15,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734290291] [2022-04-28 04:11:15,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:15,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:15,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {14390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {14384#true} is VALID [2022-04-28 04:11:15,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {14384#true} assume true; {14384#true} is VALID [2022-04-28 04:11:15,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14384#true} {14384#true} #68#return; {14384#true} is VALID [2022-04-28 04:11:15,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {14384#true} call ULTIMATE.init(); {14390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:15,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {14390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {14384#true} is VALID [2022-04-28 04:11:15,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {14384#true} assume true; {14384#true} is VALID [2022-04-28 04:11:15,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14384#true} {14384#true} #68#return; {14384#true} is VALID [2022-04-28 04:11:15,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {14384#true} call #t~ret8 := main(); {14384#true} is VALID [2022-04-28 04:11:15,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {14384#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {14389#(= main_~a~0 0)} is VALID [2022-04-28 04:11:15,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {14389#(= main_~a~0 0)} [136] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_164| |v_main_#t~pre4_163|)) (.cse1 (= v_main_~b~0_276 v_main_~b~0_274)) (.cse2 (= |v_main_#t~pre6_752| |v_main_#t~pre6_747|)) (.cse3 (= v_main_~a~0_202 v_main_~a~0_201)) (.cse4 (= v_main_~c~0_984 v_main_~c~0_978)) (.cse5 (= v_main_~d~0_2866 v_main_~d~0_2835)) (.cse6 (= |v_main_#t~pre5_201| |v_main_#t~pre5_200|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre7_2011| |v_main_#t~pre7_1985|) .cse6) (and .cse0 (= |v_main_#t~pre7_1985| |v_main_#t~pre7_2011|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_2011|, main_~c~0=v_main_~c~0_984, main_~d~0=v_main_~d~0_2866, main_~b~0=v_main_~b~0_276, main_#t~pre4=|v_main_#t~pre4_164|, main_#t~pre5=|v_main_#t~pre5_201|, main_~a~0=v_main_~a~0_202, main_#t~pre6=|v_main_#t~pre6_752|} OutVars{main_#t~pre7=|v_main_#t~pre7_1985|, main_~c~0=v_main_~c~0_978, main_~d~0=v_main_~d~0_2835, main_~b~0=v_main_~b~0_274, main_#t~pre4=|v_main_#t~pre4_163|, main_#t~pre5=|v_main_#t~pre5_200|, main_~a~0=v_main_~a~0_201, main_#t~pre6=|v_main_#t~pre6_747|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {14389#(= main_~a~0 0)} is VALID [2022-04-28 04:11:15,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {14389#(= main_~a~0 0)} [135] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {14385#false} is VALID [2022-04-28 04:11:15,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {14385#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {14385#false} is VALID [2022-04-28 04:11:15,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {14385#false} assume !false; {14385#false} is VALID [2022-04-28 04:11:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:15,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734290291] [2022-04-28 04:11:15,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734290291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:15,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:15,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:16,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:16,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [792219499] [2022-04-28 04:11:16,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [792219499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:16,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:16,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 04:11:16,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081161707] [2022-04-28 04:11:16,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:16,973 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 82 [2022-04-28 04:11:16,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:16,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:17,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:17,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 04:11:17,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:17,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 04:11:17,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 04:11:17,035 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:20,834 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-04-28 04:11:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 04:11:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 82 [2022-04-28 04:11:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 121 transitions. [2022-04-28 04:11:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 121 transitions. [2022-04-28 04:11:20,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 121 transitions. [2022-04-28 04:11:20,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:20,935 INFO L225 Difference]: With dead ends: 109 [2022-04-28 04:11:20,935 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 04:11:20,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 29 SyntacticMatches, 18 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=435, Invalid=4821, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 04:11:20,936 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 121 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:20,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 78 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 04:11:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 04:11:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-04-28 04:11:20,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:20,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:20,969 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:20,969 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:20,970 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-04-28 04:11:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-04-28 04:11:20,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:20,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:20,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 98 states. [2022-04-28 04:11:20,970 INFO L87 Difference]: Start difference. First operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 98 states. [2022-04-28 04:11:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:20,971 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-04-28 04:11:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-04-28 04:11:20,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:20,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:20,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:20,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-04-28 04:11:20,972 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 82 [2022-04-28 04:11:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:20,973 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-04-28 04:11:20,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:20,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 88 transitions. [2022-04-28 04:11:21,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-28 04:11:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 04:11:21,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:21,144 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:21,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 04:11:21,144 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1144438600, now seen corresponding path program 31 times [2022-04-28 04:11:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:21,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1160579982] [2022-04-28 04:11:21,380 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:25,466 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:25,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:25,625 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:28,392 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:28,443 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:28,546 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:32,638 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:32,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:32,858 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:32,859 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1741896707, now seen corresponding path program 1 times [2022-04-28 04:11:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:32,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902410177] [2022-04-28 04:11:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:32,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:32,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:32,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {15087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15081#true} is VALID [2022-04-28 04:11:32,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {15081#true} assume true; {15081#true} is VALID [2022-04-28 04:11:32,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15081#true} {15081#true} #68#return; {15081#true} is VALID [2022-04-28 04:11:32,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {15081#true} call ULTIMATE.init(); {15087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:32,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {15087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15081#true} is VALID [2022-04-28 04:11:32,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {15081#true} assume true; {15081#true} is VALID [2022-04-28 04:11:32,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15081#true} {15081#true} #68#return; {15081#true} is VALID [2022-04-28 04:11:32,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {15081#true} call #t~ret8 := main(); {15081#true} is VALID [2022-04-28 04:11:32,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {15081#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {15086#(= main_~a~0 0)} is VALID [2022-04-28 04:11:32,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {15086#(= main_~a~0 0)} [138] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_207| |v_main_#t~pre5_206|)) (.cse1 (= v_main_~c~0_1027 v_main_~c~0_1021)) (.cse2 (= |v_main_#t~pre4_169| |v_main_#t~pre4_168|)) (.cse3 (= v_main_~b~0_284 v_main_~b~0_282)) (.cse4 (= v_main_~a~0_208 v_main_~a~0_207)) (.cse5 (= |v_main_#t~pre6_785| |v_main_#t~pre6_780|))) (or (and (= |v_main_#t~pre7_2111| |v_main_#t~pre7_2084|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~d~0_3014 v_main_~d~0_2982)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~d~0_2982 v_main_~d~0_3014) (= |v_main_#t~pre7_2084| |v_main_#t~pre7_2111|)))) InVars {main_#t~pre7=|v_main_#t~pre7_2111|, main_~c~0=v_main_~c~0_1027, main_~d~0=v_main_~d~0_3014, main_~b~0=v_main_~b~0_284, main_#t~pre4=|v_main_#t~pre4_169|, main_#t~pre5=|v_main_#t~pre5_207|, main_~a~0=v_main_~a~0_208, main_#t~pre6=|v_main_#t~pre6_785|} OutVars{main_#t~pre7=|v_main_#t~pre7_2084|, main_~c~0=v_main_~c~0_1021, main_~d~0=v_main_~d~0_2982, main_~b~0=v_main_~b~0_282, main_#t~pre4=|v_main_#t~pre4_168|, main_#t~pre5=|v_main_#t~pre5_206|, main_~a~0=v_main_~a~0_207, main_#t~pre6=|v_main_#t~pre6_780|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15086#(= main_~a~0 0)} is VALID [2022-04-28 04:11:32,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {15086#(= main_~a~0 0)} [137] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {15082#false} is VALID [2022-04-28 04:11:32,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {15082#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {15082#false} is VALID [2022-04-28 04:11:32,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {15082#false} assume !false; {15082#false} is VALID [2022-04-28 04:11:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902410177] [2022-04-28 04:11:32,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902410177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:32,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:32,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:34,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:34,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1160579982] [2022-04-28 04:11:34,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1160579982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:34,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:34,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 04:11:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919089394] [2022-04-28 04:11:34,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:34,020 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 84 [2022-04-28 04:11:34,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:34,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:34,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:34,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 04:11:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:34,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 04:11:34,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:11:34,079 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:37,978 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-28 04:11:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 04:11:37,978 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 84 [2022-04-28 04:11:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 123 transitions. [2022-04-28 04:11:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 123 transitions. [2022-04-28 04:11:37,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 123 transitions. [2022-04-28 04:11:38,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:38,072 INFO L225 Difference]: With dead ends: 111 [2022-04-28 04:11:38,072 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 04:11:38,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=447, Invalid=5103, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 04:11:38,073 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 163 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:38,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 53 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 04:11:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 04:11:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2022-04-28 04:11:38,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:38,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:38,106 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:38,106 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:38,107 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-28 04:11:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-28 04:11:38,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:38,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:38,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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 100 states. [2022-04-28 04:11:38,108 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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 100 states. [2022-04-28 04:11:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:38,109 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-28 04:11:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-28 04:11:38,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:38,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:38,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:38,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-04-28 04:11:38,111 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 84 [2022-04-28 04:11:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:38,111 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-04-28 04:11:38,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:38,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 90 transitions. [2022-04-28 04:11:38,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-28 04:11:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 04:11:38,290 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:38,291 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:38,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 04:11:38,291 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:38,291 INFO L85 PathProgramCache]: Analyzing trace with hash -360044394, now seen corresponding path program 32 times [2022-04-28 04:11:38,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:38,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [388708290] [2022-04-28 04:11:38,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:42,610 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:42,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:42,766 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:46,353 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:46,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:46,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:50,593 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:50,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:50,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:50,810 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1741958211, now seen corresponding path program 1 times [2022-04-28 04:11:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:50,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227860833] [2022-04-28 04:11:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:50,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:50,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {15799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15793#true} is VALID [2022-04-28 04:11:50,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {15793#true} assume true; {15793#true} is VALID [2022-04-28 04:11:50,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15793#true} {15793#true} #68#return; {15793#true} is VALID [2022-04-28 04:11:50,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {15793#true} call ULTIMATE.init(); {15799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:50,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {15799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15793#true} is VALID [2022-04-28 04:11:50,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {15793#true} assume true; {15793#true} is VALID [2022-04-28 04:11:50,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15793#true} {15793#true} #68#return; {15793#true} is VALID [2022-04-28 04:11:50,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {15793#true} call #t~ret8 := main(); {15793#true} is VALID [2022-04-28 04:11:50,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {15793#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {15798#(= main_~a~0 0)} is VALID [2022-04-28 04:11:50,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {15798#(= main_~a~0 0)} [140] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_214 v_main_~a~0_213)) (.cse1 (= |v_main_#t~pre5_213| |v_main_#t~pre5_212|)) (.cse2 (= v_main_~b~0_292 v_main_~b~0_290)) (.cse3 (= v_main_~d~0_3166 v_main_~d~0_3133)) (.cse4 (= |v_main_#t~pre7_2214| |v_main_#t~pre7_2186|)) (.cse5 (= v_main_~c~0_1070 v_main_~c~0_1064))) (or (and (= |v_main_#t~pre4_173| |v_main_#t~pre4_174|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_813| |v_main_#t~pre6_818|) .cse5) (and .cse0 (= |v_main_#t~pre6_818| |v_main_#t~pre6_813|) .cse1 .cse2 .cse3 (= |v_main_#t~pre4_174| |v_main_#t~pre4_173|) .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_2214|, main_~c~0=v_main_~c~0_1070, main_~d~0=v_main_~d~0_3166, main_~b~0=v_main_~b~0_292, main_#t~pre4=|v_main_#t~pre4_174|, main_#t~pre5=|v_main_#t~pre5_213|, main_~a~0=v_main_~a~0_214, main_#t~pre6=|v_main_#t~pre6_818|} OutVars{main_#t~pre7=|v_main_#t~pre7_2186|, main_~c~0=v_main_~c~0_1064, main_~d~0=v_main_~d~0_3133, main_~b~0=v_main_~b~0_290, main_#t~pre4=|v_main_#t~pre4_173|, main_#t~pre5=|v_main_#t~pre5_212|, main_~a~0=v_main_~a~0_213, main_#t~pre6=|v_main_#t~pre6_813|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15798#(= main_~a~0 0)} is VALID [2022-04-28 04:11:50,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {15798#(= main_~a~0 0)} [139] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {15794#false} is VALID [2022-04-28 04:11:50,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {15794#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {15794#false} is VALID [2022-04-28 04:11:50,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {15794#false} assume !false; {15794#false} is VALID [2022-04-28 04:11:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:50,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:50,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227860833] [2022-04-28 04:11:50,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227860833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:50,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:50,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:51,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [388708290] [2022-04-28 04:11:51,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [388708290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:51,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:51,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 04:11:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278689045] [2022-04-28 04:11:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:51,943 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 86 [2022-04-28 04:11:51,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:51,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:52,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:52,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 04:11:52,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 04:11:52,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1405, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 04:11:52,003 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:55,830 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-28 04:11:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 04:11:55,830 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 86 [2022-04-28 04:11:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 125 transitions. [2022-04-28 04:11:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 125 transitions. [2022-04-28 04:11:55,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 125 transitions. [2022-04-28 04:11:55,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:55,928 INFO L225 Difference]: With dead ends: 113 [2022-04-28 04:11:55,928 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 04:11:55,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 32 SyntacticMatches, 17 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=459, Invalid=5393, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 04:11:55,929 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 126 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:55,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 38 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 04:11:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 04:11:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2022-04-28 04:11:55,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:55,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,965 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,965 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:55,966 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-04-28 04:11:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2022-04-28 04:11:55,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:55,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:55,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 102 states. [2022-04-28 04:11:55,967 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 102 states. [2022-04-28 04:11:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:55,968 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-04-28 04:11:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2022-04-28 04:11:55,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:55,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:55,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:55,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-04-28 04:11:55,970 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 86 [2022-04-28 04:11:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:55,970 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-04-28 04:11:55,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 92 transitions. [2022-04-28 04:11:56,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-28 04:11:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 04:11:56,157 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:56,157 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:56,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-28 04:11:56,157 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1823510772, now seen corresponding path program 33 times [2022-04-28 04:11:56,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:56,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [269774852] [2022-04-28 04:11:56,397 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:56,531 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:56,635 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:56,764 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:56,864 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:56,993 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:57,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:57,212 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1742019715, now seen corresponding path program 1 times [2022-04-28 04:11:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:57,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960169950] [2022-04-28 04:11:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:57,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:57,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {16526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {16520#true} is VALID [2022-04-28 04:11:57,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {16520#true} assume true; {16520#true} is VALID [2022-04-28 04:11:57,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16520#true} {16520#true} #68#return; {16520#true} is VALID [2022-04-28 04:11:57,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {16520#true} call ULTIMATE.init(); {16526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:57,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {16526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {16520#true} is VALID [2022-04-28 04:11:57,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {16520#true} assume true; {16520#true} is VALID [2022-04-28 04:11:57,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16520#true} {16520#true} #68#return; {16520#true} is VALID [2022-04-28 04:11:57,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {16520#true} call #t~ret8 := main(); {16520#true} is VALID [2022-04-28 04:11:57,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {16520#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {16525#(= main_~a~0 0)} is VALID [2022-04-28 04:11:57,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {16525#(= main_~a~0 0)} [142] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre6_851| |v_main_#t~pre6_846|) (= v_main_~c~0_1113 v_main_~c~0_1107) (= |v_main_#t~pre5_219| |v_main_#t~pre5_218|) (= |v_main_#t~pre7_2320| |v_main_#t~pre7_2291|) (= |v_main_#t~pre4_179| |v_main_#t~pre4_178|) (= v_main_~a~0_220 v_main_~a~0_219) (= v_main_~d~0_3322 v_main_~d~0_3288) (= v_main_~b~0_300 v_main_~b~0_298)) InVars {main_#t~pre7=|v_main_#t~pre7_2320|, main_~c~0=v_main_~c~0_1113, main_~d~0=v_main_~d~0_3322, main_~b~0=v_main_~b~0_300, main_#t~pre4=|v_main_#t~pre4_179|, main_#t~pre5=|v_main_#t~pre5_219|, main_~a~0=v_main_~a~0_220, main_#t~pre6=|v_main_#t~pre6_851|} OutVars{main_#t~pre7=|v_main_#t~pre7_2291|, main_~c~0=v_main_~c~0_1107, main_~d~0=v_main_~d~0_3288, main_~b~0=v_main_~b~0_298, main_#t~pre4=|v_main_#t~pre4_178|, main_#t~pre5=|v_main_#t~pre5_218|, main_~a~0=v_main_~a~0_219, main_#t~pre6=|v_main_#t~pre6_846|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {16525#(= main_~a~0 0)} is VALID [2022-04-28 04:11:57,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {16525#(= main_~a~0 0)} [141] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {16521#false} is VALID [2022-04-28 04:11:57,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {16521#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {16521#false} is VALID [2022-04-28 04:11:57,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {16521#false} assume !false; {16521#false} is VALID [2022-04-28 04:11:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:57,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:57,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960169950] [2022-04-28 04:11:57,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960169950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:57,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:57,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:58,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:58,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [269774852] [2022-04-28 04:11:58,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [269774852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:58,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:58,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 04:11:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19931424] [2022-04-28 04:11:58,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:58,449 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 88 [2022-04-28 04:11:58,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:58,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:58,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:58,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 04:11:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 04:11:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1481, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:11:58,510 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:02,668 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-28 04:12:02,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 04:12:02,668 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 88 [2022-04-28 04:12:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2022-04-28 04:12:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2022-04-28 04:12:02,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2022-04-28 04:12:02,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:02,772 INFO L225 Difference]: With dead ends: 117 [2022-04-28 04:12:02,772 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 04:12:02,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 29 SyntacticMatches, 21 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=471, Invalid=5691, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 04:12:02,773 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 164 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:02,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 28 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 04:12:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 04:12:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2022-04-28 04:12:02,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:02,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:02,815 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:02,815 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:02,817 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2022-04-28 04:12:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-04-28 04:12:02,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:02,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:02,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 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 106 states. [2022-04-28 04:12:02,818 INFO L87 Difference]: Start difference. First operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 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 106 states. [2022-04-28 04:12:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:02,819 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2022-04-28 04:12:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-04-28 04:12:02,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:02,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:02,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:02,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-28 04:12:02,821 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 88 [2022-04-28 04:12:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:02,821 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-28 04:12:02,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:02,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 96 transitions. [2022-04-28 04:12:03,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-28 04:12:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 04:12:03,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:03,072 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:03,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-28 04:12:03,072 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash -18982446, now seen corresponding path program 34 times [2022-04-28 04:12:03,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:03,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987024983] [2022-04-28 04:12:03,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:06,994 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:07,047 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:07,142 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:11,231 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:11,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:11,388 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:13,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:14,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:14,127 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1742081219, now seen corresponding path program 1 times [2022-04-28 04:12:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:14,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330321277] [2022-04-28 04:12:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:14,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {17280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {17274#true} is VALID [2022-04-28 04:12:14,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {17274#true} assume true; {17274#true} is VALID [2022-04-28 04:12:14,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17274#true} {17274#true} #68#return; {17274#true} is VALID [2022-04-28 04:12:14,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {17274#true} call ULTIMATE.init(); {17280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:14,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {17280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {17274#true} is VALID [2022-04-28 04:12:14,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {17274#true} assume true; {17274#true} is VALID [2022-04-28 04:12:14,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17274#true} {17274#true} #68#return; {17274#true} is VALID [2022-04-28 04:12:14,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {17274#true} call #t~ret8 := main(); {17274#true} is VALID [2022-04-28 04:12:14,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {17274#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {17279#(= main_~a~0 0)} is VALID [2022-04-28 04:12:14,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {17279#(= main_~a~0 0)} [144] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_226 v_main_~a~0_225)) (.cse1 (= v_main_~b~0_308 v_main_~b~0_306)) (.cse2 (= v_main_~c~0_1154 v_main_~c~0_1148)) (.cse3 (= v_main_~d~0_3475 v_main_~d~0_3440)) (.cse4 (= |v_main_#t~pre5_225| |v_main_#t~pre5_224|)) (.cse5 (= |v_main_#t~pre4_184| |v_main_#t~pre4_183|)) (.cse6 (= |v_main_#t~pre7_2423| |v_main_#t~pre7_2393|))) (or (and .cse0 .cse1 (= |v_main_#t~pre6_883| |v_main_#t~pre6_878|) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |v_main_#t~pre6_878| |v_main_#t~pre6_883|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_2423|, main_~c~0=v_main_~c~0_1154, main_~d~0=v_main_~d~0_3475, main_~b~0=v_main_~b~0_308, main_#t~pre4=|v_main_#t~pre4_184|, main_#t~pre5=|v_main_#t~pre5_225|, main_~a~0=v_main_~a~0_226, main_#t~pre6=|v_main_#t~pre6_883|} OutVars{main_#t~pre7=|v_main_#t~pre7_2393|, main_~c~0=v_main_~c~0_1148, main_~d~0=v_main_~d~0_3440, main_~b~0=v_main_~b~0_306, main_#t~pre4=|v_main_#t~pre4_183|, main_#t~pre5=|v_main_#t~pre5_224|, main_~a~0=v_main_~a~0_225, main_#t~pre6=|v_main_#t~pre6_878|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {17279#(= main_~a~0 0)} is VALID [2022-04-28 04:12:14,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {17279#(= main_~a~0 0)} [143] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {17275#false} is VALID [2022-04-28 04:12:14,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {17275#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {17275#false} is VALID [2022-04-28 04:12:14,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {17275#false} assume !false; {17275#false} is VALID [2022-04-28 04:12:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:12:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:14,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330321277] [2022-04-28 04:12:14,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330321277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:14,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:14,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:15,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:15,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987024983] [2022-04-28 04:12:15,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987024983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:15,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:15,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 04:12:15,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087957817] [2022-04-28 04:12:15,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:15,486 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 90 [2022-04-28 04:12:15,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:15,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:15,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:15,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 04:12:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 04:12:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 04:12:15,550 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:19,911 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-04-28 04:12:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 04:12:19,912 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 90 [2022-04-28 04:12:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 130 transitions. [2022-04-28 04:12:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 130 transitions. [2022-04-28 04:12:19,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 130 transitions. [2022-04-28 04:12:20,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:20,016 INFO L225 Difference]: With dead ends: 118 [2022-04-28 04:12:20,016 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 04:12:20,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 27 SyntacticMatches, 24 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=483, Invalid=5997, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 04:12:20,017 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 156 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:20,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 118 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 04:12:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 04:12:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2022-04-28 04:12:20,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:20,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:20,070 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:20,070 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:20,071 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-04-28 04:12:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-04-28 04:12:20,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:20,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:20,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 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 107 states. [2022-04-28 04:12:20,072 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 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 107 states. [2022-04-28 04:12:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:20,073 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-04-28 04:12:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-04-28 04:12:20,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:20,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:20,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:20,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-04-28 04:12:20,074 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 90 [2022-04-28 04:12:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:20,075 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-04-28 04:12:20,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:20,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 98 transitions. [2022-04-28 04:12:20,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-28 04:12:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 04:12:20,282 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:20,282 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:20,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-28 04:12:20,282 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1299109051, now seen corresponding path program 35 times [2022-04-28 04:12:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:20,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436067754] [2022-04-28 04:12:20,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:20,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:20,753 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:20,880 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:20,992 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:21,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:21,365 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:21,365 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1742142723, now seen corresponding path program 1 times [2022-04-28 04:12:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:21,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589244132] [2022-04-28 04:12:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:21,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:21,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {18045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18039#true} is VALID [2022-04-28 04:12:21,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {18039#true} assume true; {18039#true} is VALID [2022-04-28 04:12:21,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18039#true} {18039#true} #68#return; {18039#true} is VALID [2022-04-28 04:12:21,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {18039#true} call ULTIMATE.init(); {18045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:21,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {18045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18039#true} is VALID [2022-04-28 04:12:21,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {18039#true} assume true; {18039#true} is VALID [2022-04-28 04:12:21,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18039#true} {18039#true} #68#return; {18039#true} is VALID [2022-04-28 04:12:21,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {18039#true} call #t~ret8 := main(); {18039#true} is VALID [2022-04-28 04:12:21,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {18039#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {18044#(= main_~a~0 0)} is VALID [2022-04-28 04:12:21,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {18044#(= main_~a~0 0)} [146] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1200 v_main_~c~0_1193)) (.cse1 (= |v_main_#t~pre5_231| |v_main_#t~pre5_230|)) (.cse2 (= v_main_~d~0_3632 v_main_~d~0_3596)) (.cse3 (= |v_main_#t~pre7_2526| |v_main_#t~pre7_2496|)) (.cse4 (= v_main_~a~0_232 v_main_~a~0_231)) (.cse5 (= |v_main_#t~pre4_189| |v_main_#t~pre4_188|)) (.cse6 (= v_main_~b~0_316 v_main_~b~0_314))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre6_912| |v_main_#t~pre6_918|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_918| |v_main_#t~pre6_912|) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_2526|, main_~c~0=v_main_~c~0_1200, main_~d~0=v_main_~d~0_3632, main_~b~0=v_main_~b~0_316, main_#t~pre4=|v_main_#t~pre4_189|, main_#t~pre5=|v_main_#t~pre5_231|, main_~a~0=v_main_~a~0_232, main_#t~pre6=|v_main_#t~pre6_918|} OutVars{main_#t~pre7=|v_main_#t~pre7_2496|, main_~c~0=v_main_~c~0_1193, main_~d~0=v_main_~d~0_3596, main_~b~0=v_main_~b~0_314, main_#t~pre4=|v_main_#t~pre4_188|, main_#t~pre5=|v_main_#t~pre5_230|, main_~a~0=v_main_~a~0_231, main_#t~pre6=|v_main_#t~pre6_912|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18044#(= main_~a~0 0)} is VALID [2022-04-28 04:12:21,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {18044#(= main_~a~0 0)} [145] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {18040#false} is VALID [2022-04-28 04:12:21,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {18040#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {18040#false} is VALID [2022-04-28 04:12:21,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {18040#false} assume !false; {18040#false} is VALID [2022-04-28 04:12:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:12:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:21,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589244132] [2022-04-28 04:12:21,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589244132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:21,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:21,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:22,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:22,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436067754] [2022-04-28 04:12:22,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436067754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:22,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:22,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 04:12:22,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125790209] [2022-04-28 04:12:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:22,851 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 93 [2022-04-28 04:12:22,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:22,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:22,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:22,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 04:12:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:22,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 04:12:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:12:22,919 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:27,621 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2022-04-28 04:12:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 04:12:27,621 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 93 [2022-04-28 04:12:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 132 transitions. [2022-04-28 04:12:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 132 transitions. [2022-04-28 04:12:27,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 132 transitions. [2022-04-28 04:12:27,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:27,726 INFO L225 Difference]: With dead ends: 120 [2022-04-28 04:12:27,726 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 04:12:27,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 26 SyntacticMatches, 27 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=495, Invalid=6311, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 04:12:27,727 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 176 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2926 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:27,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 38 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2926 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 04:12:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 04:12:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2022-04-28 04:12:27,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:27,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:27,771 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:27,771 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:27,772 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-04-28 04:12:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-04-28 04:12:27,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:27,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:27,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 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 109 states. [2022-04-28 04:12:27,772 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 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 109 states. [2022-04-28 04:12:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:27,774 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-04-28 04:12:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-04-28 04:12:27,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:27,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:27,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:27,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2022-04-28 04:12:27,776 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 93 [2022-04-28 04:12:27,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:27,776 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2022-04-28 04:12:27,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:27,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 99 transitions. [2022-04-28 04:12:27,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-04-28 04:12:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 04:12:27,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:27,994 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:27,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-28 04:12:27,995 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:27,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1457862695, now seen corresponding path program 36 times [2022-04-28 04:12:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:27,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759149547] [2022-04-28 04:12:28,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:28,370 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:28,493 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:28,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:28,714 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:28,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:29,032 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:29,033 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1742204227, now seen corresponding path program 1 times [2022-04-28 04:12:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:29,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82114853] [2022-04-28 04:12:29,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:29,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {18823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18817#true} is VALID [2022-04-28 04:12:29,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {18817#true} assume true; {18817#true} is VALID [2022-04-28 04:12:29,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18817#true} {18817#true} #68#return; {18817#true} is VALID [2022-04-28 04:12:29,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {18817#true} call ULTIMATE.init(); {18823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:29,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {18823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18817#true} is VALID [2022-04-28 04:12:29,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {18817#true} assume true; {18817#true} is VALID [2022-04-28 04:12:29,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18817#true} {18817#true} #68#return; {18817#true} is VALID [2022-04-28 04:12:29,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {18817#true} call #t~ret8 := main(); {18817#true} is VALID [2022-04-28 04:12:29,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {18817#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {18822#(= main_~a~0 0)} is VALID [2022-04-28 04:12:29,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {18822#(= main_~a~0 0)} [148] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_238 v_main_~a~0_237)) (.cse1 (= |v_main_#t~pre4_194| |v_main_#t~pre4_193|)) (.cse2 (= v_main_~b~0_324 v_main_~b~0_322)) (.cse3 (= v_main_~d~0_3793 v_main_~d~0_3756)) (.cse4 (= |v_main_#t~pre7_2627| |v_main_#t~pre7_2596|)) (.cse5 (= |v_main_#t~pre5_237| |v_main_#t~pre5_236|))) (or (and (= v_main_~c~0_1246 v_main_~c~0_1239) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre6_953| |v_main_#t~pre6_947|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre6_947| |v_main_#t~pre6_953|) (= v_main_~c~0_1239 v_main_~c~0_1246)))) InVars {main_#t~pre7=|v_main_#t~pre7_2627|, main_~c~0=v_main_~c~0_1246, main_~d~0=v_main_~d~0_3793, main_~b~0=v_main_~b~0_324, main_#t~pre4=|v_main_#t~pre4_194|, main_#t~pre5=|v_main_#t~pre5_237|, main_~a~0=v_main_~a~0_238, main_#t~pre6=|v_main_#t~pre6_953|} OutVars{main_#t~pre7=|v_main_#t~pre7_2596|, main_~c~0=v_main_~c~0_1239, main_~d~0=v_main_~d~0_3756, main_~b~0=v_main_~b~0_322, main_#t~pre4=|v_main_#t~pre4_193|, main_#t~pre5=|v_main_#t~pre5_236|, main_~a~0=v_main_~a~0_237, main_#t~pre6=|v_main_#t~pre6_947|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18822#(= main_~a~0 0)} is VALID [2022-04-28 04:12:29,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {18822#(= main_~a~0 0)} [147] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {18818#false} is VALID [2022-04-28 04:12:29,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {18818#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {18818#false} is VALID [2022-04-28 04:12:29,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {18818#false} assume !false; {18818#false} is VALID [2022-04-28 04:12:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:12:29,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:29,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82114853] [2022-04-28 04:12:29,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82114853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:29,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:29,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:30,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:30,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759149547] [2022-04-28 04:12:30,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759149547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:30,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:30,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 04:12:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635214626] [2022-04-28 04:12:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:30,416 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 95 [2022-04-28 04:12:30,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:30,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:30,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:30,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 04:12:30,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:30,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 04:12:30,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1721, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 04:12:30,485 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:35,334 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2022-04-28 04:12:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 04:12:35,334 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 95 [2022-04-28 04:12:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 134 transitions. [2022-04-28 04:12:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 134 transitions. [2022-04-28 04:12:35,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 134 transitions. [2022-04-28 04:12:35,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:35,448 INFO L225 Difference]: With dead ends: 122 [2022-04-28 04:12:35,448 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 04:12:35,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 33 SyntacticMatches, 21 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=507, Invalid=6633, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 04:12:35,449 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:35,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 18 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 04:12:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 04:12:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2022-04-28 04:12:35,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:35,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:35,493 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:35,493 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:35,494 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-04-28 04:12:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-04-28 04:12:35,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:35,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:35,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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 111 states. [2022-04-28 04:12:35,495 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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 111 states. [2022-04-28 04:12:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:35,496 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-04-28 04:12:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-04-28 04:12:35,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:35,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:35,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:35,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-04-28 04:12:35,498 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 95 [2022-04-28 04:12:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:35,499 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-04-28 04:12:35,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:35,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 101 transitions. [2022-04-28 04:12:35,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-04-28 04:12:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 04:12:35,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:35,713 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:35,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-28 04:12:35,713 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -912888969, now seen corresponding path program 37 times [2022-04-28 04:12:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:35,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2052387642] [2022-04-28 04:12:35,939 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:36,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:36,171 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:36,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:36,398 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:36,523 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:36,718 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:36,718 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1742265731, now seen corresponding path program 1 times [2022-04-28 04:12:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050196912] [2022-04-28 04:12:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:36,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:36,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:36,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {19616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19610#true} is VALID [2022-04-28 04:12:36,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {19610#true} assume true; {19610#true} is VALID [2022-04-28 04:12:36,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19610#true} {19610#true} #68#return; {19610#true} is VALID [2022-04-28 04:12:36,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {19610#true} call ULTIMATE.init(); {19616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:36,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {19616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19610#true} is VALID [2022-04-28 04:12:36,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {19610#true} assume true; {19610#true} is VALID [2022-04-28 04:12:36,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19610#true} {19610#true} #68#return; {19610#true} is VALID [2022-04-28 04:12:36,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {19610#true} call #t~ret8 := main(); {19610#true} is VALID [2022-04-28 04:12:36,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {19610#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {19615#(= main_~a~0 0)} is VALID [2022-04-28 04:12:36,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {19615#(= main_~a~0 0)} [150] L22-3-->L22-4_primed: Formula: (and (= v_main_~d~0_3958 v_main_~d~0_3920) (= |v_main_#t~pre4_199| |v_main_#t~pre4_198|) (= |v_main_#t~pre6_988| |v_main_#t~pre6_982|) (= v_main_~a~0_244 v_main_~a~0_243) (= v_main_~b~0_332 v_main_~b~0_330) (= v_main_~c~0_1292 v_main_~c~0_1285) (= |v_main_#t~pre5_243| |v_main_#t~pre5_242|) (= |v_main_#t~pre7_2736| |v_main_#t~pre7_2704|)) InVars {main_#t~pre7=|v_main_#t~pre7_2736|, main_~c~0=v_main_~c~0_1292, main_~d~0=v_main_~d~0_3958, main_~b~0=v_main_~b~0_332, main_#t~pre4=|v_main_#t~pre4_199|, main_#t~pre5=|v_main_#t~pre5_243|, main_~a~0=v_main_~a~0_244, main_#t~pre6=|v_main_#t~pre6_988|} OutVars{main_#t~pre7=|v_main_#t~pre7_2704|, main_~c~0=v_main_~c~0_1285, main_~d~0=v_main_~d~0_3920, main_~b~0=v_main_~b~0_330, main_#t~pre4=|v_main_#t~pre4_198|, main_#t~pre5=|v_main_#t~pre5_242|, main_~a~0=v_main_~a~0_243, main_#t~pre6=|v_main_#t~pre6_982|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19615#(= main_~a~0 0)} is VALID [2022-04-28 04:12:36,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {19615#(= main_~a~0 0)} [149] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {19611#false} is VALID [2022-04-28 04:12:36,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {19611#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {19611#false} is VALID [2022-04-28 04:12:36,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {19611#false} assume !false; {19611#false} is VALID [2022-04-28 04:12:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:12:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:36,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050196912] [2022-04-28 04:12:36,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050196912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:36,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:36,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:38,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:38,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2052387642] [2022-04-28 04:12:38,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2052387642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:38,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:38,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 04:12:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366137289] [2022-04-28 04:12:38,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 97 [2022-04-28 04:12:38,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:38,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:38,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:38,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 04:12:38,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:38,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 04:12:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1805, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:12:38,216 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:43,140 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2022-04-28 04:12:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 04:12:43,140 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 97 [2022-04-28 04:12:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 136 transitions. [2022-04-28 04:12:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 136 transitions. [2022-04-28 04:12:43,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 136 transitions. [2022-04-28 04:12:43,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:43,250 INFO L225 Difference]: With dead ends: 124 [2022-04-28 04:12:43,250 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 04:12:43,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 34 SyntacticMatches, 21 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=519, Invalid=6963, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 04:12:43,250 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 127 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:43,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 108 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 04:12:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 04:12:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2022-04-28 04:12:43,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:43,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:43,297 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:43,298 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:43,299 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2022-04-28 04:12:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2022-04-28 04:12:43,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:43,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:43,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 113 states. [2022-04-28 04:12:43,300 INFO L87 Difference]: Start difference. First operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 113 states. [2022-04-28 04:12:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:43,301 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2022-04-28 04:12:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2022-04-28 04:12:43,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:43,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:43,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:43,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-04-28 04:12:43,303 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 97 [2022-04-28 04:12:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:43,304 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-04-28 04:12:43,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:43,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 103 transitions. [2022-04-28 04:12:43,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-04-28 04:12:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 04:12:43,590 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:43,590 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:43,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-28 04:12:43,590 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1179148395, now seen corresponding path program 38 times [2022-04-28 04:12:43,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:43,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970241264] [2022-04-28 04:12:43,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:44,044 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:44,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:44,261 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:44,359 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:44,490 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:44,692 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:44,692 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:44,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1742327235, now seen corresponding path program 1 times [2022-04-28 04:12:44,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:44,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897936793] [2022-04-28 04:12:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:44,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:44,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-28 04:12:44,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-28 04:12:44,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20418#true} {20418#true} #68#return; {20418#true} is VALID [2022-04-28 04:12:44,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {20418#true} call ULTIMATE.init(); {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:44,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-28 04:12:44,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-28 04:12:44,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20418#true} {20418#true} #68#return; {20418#true} is VALID [2022-04-28 04:12:44,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {20418#true} call #t~ret8 := main(); {20418#true} is VALID [2022-04-28 04:12:44,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {20418#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {20423#(= main_~a~0 0)} is VALID [2022-04-28 04:12:44,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {20423#(= main_~a~0 0)} [152] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_4127 v_main_~d~0_4088)) (.cse1 (= |v_main_#t~pre7_2848| |v_main_#t~pre7_2815|)) (.cse2 (= v_main_~b~0_340 v_main_~b~0_338)) (.cse3 (= |v_main_#t~pre5_249| |v_main_#t~pre5_248|)) (.cse4 (= |v_main_#t~pre4_204| |v_main_#t~pre4_203|))) (or (and .cse0 (= |v_main_#t~pre6_1017| |v_main_#t~pre6_1023|) .cse1 .cse2 .cse3 (= v_main_~a~0_249 v_main_~a~0_250) (= v_main_~c~0_1331 v_main_~c~0_1338) .cse4) (and .cse0 .cse1 (= v_main_~c~0_1338 v_main_~c~0_1331) .cse2 .cse3 (= |v_main_#t~pre6_1023| |v_main_#t~pre6_1017|) .cse4 (= v_main_~a~0_250 v_main_~a~0_249)))) InVars {main_#t~pre7=|v_main_#t~pre7_2848|, main_~c~0=v_main_~c~0_1338, main_~d~0=v_main_~d~0_4127, main_~b~0=v_main_~b~0_340, main_#t~pre4=|v_main_#t~pre4_204|, main_#t~pre5=|v_main_#t~pre5_249|, main_~a~0=v_main_~a~0_250, main_#t~pre6=|v_main_#t~pre6_1023|} OutVars{main_#t~pre7=|v_main_#t~pre7_2815|, main_~c~0=v_main_~c~0_1331, main_~d~0=v_main_~d~0_4088, main_~b~0=v_main_~b~0_338, main_#t~pre4=|v_main_#t~pre4_203|, main_#t~pre5=|v_main_#t~pre5_248|, main_~a~0=v_main_~a~0_249, main_#t~pre6=|v_main_#t~pre6_1017|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {20423#(= main_~a~0 0)} is VALID [2022-04-28 04:12:44,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {20423#(= main_~a~0 0)} [151] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {20419#false} is VALID [2022-04-28 04:12:44,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {20419#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {20419#false} is VALID [2022-04-28 04:12:44,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {20419#false} assume !false; {20419#false} is VALID [2022-04-28 04:12:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:12:44,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:44,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897936793] [2022-04-28 04:12:44,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897936793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:44,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:44,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:46,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:46,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970241264] [2022-04-28 04:12:46,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970241264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:46,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:46,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 04:12:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033496180] [2022-04-28 04:12:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:46,239 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 99 [2022-04-28 04:12:46,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:46,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:46,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:46,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 04:12:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 04:12:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1891, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 04:12:46,311 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:51,846 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-04-28 04:12:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 04:12:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 99 [2022-04-28 04:12:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 138 transitions. [2022-04-28 04:12:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 138 transitions. [2022-04-28 04:12:51,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 138 transitions. [2022-04-28 04:12:51,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:51,952 INFO L225 Difference]: With dead ends: 126 [2022-04-28 04:12:51,952 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 04:12:51,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 35 SyntacticMatches, 21 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=531, Invalid=7301, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 04:12:51,954 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 138 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:51,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 63 Invalid, 3597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3499 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 04:12:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 04:12:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2022-04-28 04:12:52,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:52,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:52,003 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:52,004 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:52,006 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-04-28 04:12:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-04-28 04:12:52,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:52,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:52,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 115 states. [2022-04-28 04:12:52,007 INFO L87 Difference]: Start difference. First operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 115 states. [2022-04-28 04:12:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:52,008 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-04-28 04:12:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-04-28 04:12:52,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:52,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:52,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:52,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-28 04:12:52,010 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 99 [2022-04-28 04:12:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:52,010 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-28 04:12:52,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:52,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-28 04:12:52,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 04:12:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 04:12:52,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:52,248 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:52,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-28 04:12:52,248 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 643580979, now seen corresponding path program 39 times [2022-04-28 04:12:52,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:52,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961981994] [2022-04-28 04:12:52,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:52,631 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:52,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:52,864 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:52,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:53,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:53,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:53,296 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1742388739, now seen corresponding path program 1 times [2022-04-28 04:12:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:53,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320225955] [2022-04-28 04:12:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:53,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:53,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {21247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21241#true} is VALID [2022-04-28 04:12:53,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {21241#true} assume true; {21241#true} is VALID [2022-04-28 04:12:53,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21241#true} {21241#true} #68#return; {21241#true} is VALID [2022-04-28 04:12:53,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {21241#true} call ULTIMATE.init(); {21247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:53,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {21247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21241#true} is VALID [2022-04-28 04:12:53,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {21241#true} assume true; {21241#true} is VALID [2022-04-28 04:12:53,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21241#true} {21241#true} #68#return; {21241#true} is VALID [2022-04-28 04:12:53,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {21241#true} call #t~ret8 := main(); {21241#true} is VALID [2022-04-28 04:12:53,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {21241#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {21246#(= main_~a~0 0)} is VALID [2022-04-28 04:12:53,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {21246#(= main_~a~0 0)} [154] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_348 v_main_~b~0_346)) (.cse1 (= v_main_~a~0_256 v_main_~a~0_255)) (.cse2 (= |v_main_#t~pre7_2963| |v_main_#t~pre7_2929|)) (.cse3 (= |v_main_#t~pre5_255| |v_main_#t~pre5_254|)) (.cse4 (= |v_main_#t~pre4_209| |v_main_#t~pre4_208|)) (.cse5 (= v_main_~d~0_4300 v_main_~d~0_4260)) (.cse6 (= |v_main_#t~pre6_1058| |v_main_#t~pre6_1052|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_1384 v_main_~c~0_1377) .cse5 .cse6) (and .cse0 (= v_main_~c~0_1377 v_main_~c~0_1384) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_2963|, main_~c~0=v_main_~c~0_1384, main_~d~0=v_main_~d~0_4300, main_~b~0=v_main_~b~0_348, main_#t~pre4=|v_main_#t~pre4_209|, main_#t~pre5=|v_main_#t~pre5_255|, main_~a~0=v_main_~a~0_256, main_#t~pre6=|v_main_#t~pre6_1058|} OutVars{main_#t~pre7=|v_main_#t~pre7_2929|, main_~c~0=v_main_~c~0_1377, main_~d~0=v_main_~d~0_4260, main_~b~0=v_main_~b~0_346, main_#t~pre4=|v_main_#t~pre4_208|, main_#t~pre5=|v_main_#t~pre5_254|, main_~a~0=v_main_~a~0_255, main_#t~pre6=|v_main_#t~pre6_1052|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {21246#(= main_~a~0 0)} is VALID [2022-04-28 04:12:53,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {21246#(= main_~a~0 0)} [153] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {21242#false} is VALID [2022-04-28 04:12:53,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {21242#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {21242#false} is VALID [2022-04-28 04:12:53,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {21242#false} assume !false; {21242#false} is VALID [2022-04-28 04:12:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:12:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:53,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320225955] [2022-04-28 04:12:53,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320225955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:53,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:53,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:54,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:54,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961981994] [2022-04-28 04:12:54,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961981994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:54,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:54,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 04:12:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551395639] [2022-04-28 04:12:54,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:54,894 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 101 [2022-04-28 04:12:54,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:54,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:54,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:54,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 04:12:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:54,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 04:12:54,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1979, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:12:54,965 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:00,868 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-04-28 04:13:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 04:13:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 101 [2022-04-28 04:13:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 140 transitions. [2022-04-28 04:13:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 140 transitions. [2022-04-28 04:13:00,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 140 transitions. [2022-04-28 04:13:00,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:00,973 INFO L225 Difference]: With dead ends: 128 [2022-04-28 04:13:00,973 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 04:13:00,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 35 SyntacticMatches, 22 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=543, Invalid=7647, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 04:13:00,974 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 131 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 3772 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:00,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 138 Invalid, 3866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3772 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 04:13:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 04:13:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2022-04-28 04:13:01,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:01,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:01,025 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:01,025 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:01,026 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-04-28 04:13:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2022-04-28 04:13:01,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:01,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:01,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 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 117 states. [2022-04-28 04:13:01,027 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 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 117 states. [2022-04-28 04:13:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:01,028 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-04-28 04:13:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2022-04-28 04:13:01,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:01,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:01,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:01,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2022-04-28 04:13:01,030 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 101 [2022-04-28 04:13:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:01,030 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2022-04-28 04:13:01,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:01,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 107 transitions. [2022-04-28 04:13:01,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2022-04-28 04:13:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 04:13:01,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:01,261 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:01,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-28 04:13:01,261 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash -60147375, now seen corresponding path program 40 times [2022-04-28 04:13:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:01,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877568198] [2022-04-28 04:13:01,490 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:05,576 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:05,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:05,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:09,817 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:09,867 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:09,961 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:14,053 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:14,104 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:14,293 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:14,294 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1742450243, now seen corresponding path program 1 times [2022-04-28 04:13:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:14,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736164676] [2022-04-28 04:13:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:14,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:14,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {22085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {22079#true} is VALID [2022-04-28 04:13:14,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {22079#true} assume true; {22079#true} is VALID [2022-04-28 04:13:14,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22079#true} {22079#true} #68#return; {22079#true} is VALID [2022-04-28 04:13:14,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {22079#true} call ULTIMATE.init(); {22085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:14,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {22085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {22079#true} is VALID [2022-04-28 04:13:14,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {22079#true} assume true; {22079#true} is VALID [2022-04-28 04:13:14,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22079#true} {22079#true} #68#return; {22079#true} is VALID [2022-04-28 04:13:14,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {22079#true} call #t~ret8 := main(); {22079#true} is VALID [2022-04-28 04:13:14,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {22079#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {22084#(= main_~a~0 0)} is VALID [2022-04-28 04:13:14,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {22084#(= main_~a~0 0)} [156] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_356 v_main_~b~0_354)) (.cse1 (= v_main_~a~0_262 v_main_~a~0_261)) (.cse2 (= |v_main_#t~pre7_3081| |v_main_#t~pre7_3046|)) (.cse3 (= |v_main_#t~pre4_214| |v_main_#t~pre4_213|)) (.cse4 (= v_main_~d~0_4477 v_main_~d~0_4436)) (.cse5 (= v_main_~c~0_1430 v_main_~c~0_1423))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre5_261| |v_main_#t~pre5_260|) .cse4 (= |v_main_#t~pre6_1093| |v_main_#t~pre6_1087|) .cse5) (and (= |v_main_#t~pre6_1087| |v_main_#t~pre6_1093|) (= |v_main_#t~pre5_260| |v_main_#t~pre5_261|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_3081|, main_~c~0=v_main_~c~0_1430, main_~d~0=v_main_~d~0_4477, main_~b~0=v_main_~b~0_356, main_#t~pre4=|v_main_#t~pre4_214|, main_#t~pre5=|v_main_#t~pre5_261|, main_~a~0=v_main_~a~0_262, main_#t~pre6=|v_main_#t~pre6_1093|} OutVars{main_#t~pre7=|v_main_#t~pre7_3046|, main_~c~0=v_main_~c~0_1423, main_~d~0=v_main_~d~0_4436, main_~b~0=v_main_~b~0_354, main_#t~pre4=|v_main_#t~pre4_213|, main_#t~pre5=|v_main_#t~pre5_260|, main_~a~0=v_main_~a~0_261, main_#t~pre6=|v_main_#t~pre6_1087|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {22084#(= main_~a~0 0)} is VALID [2022-04-28 04:13:14,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {22084#(= main_~a~0 0)} [155] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {22080#false} is VALID [2022-04-28 04:13:14,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {22080#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {22080#false} is VALID [2022-04-28 04:13:14,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {22080#false} assume !false; {22080#false} is VALID [2022-04-28 04:13:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:13:14,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:14,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736164676] [2022-04-28 04:13:14,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736164676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:14,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:14,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:15,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:15,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877568198] [2022-04-28 04:13:15,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877568198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:15,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:15,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 04:13:15,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955441435] [2022-04-28 04:13:15,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:15,977 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 103 [2022-04-28 04:13:15,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:15,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:16,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:16,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 04:13:16,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:16,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 04:13:16,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2069, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 04:13:16,064 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:22,681 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2022-04-28 04:13:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 04:13:22,681 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 103 [2022-04-28 04:13:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2022-04-28 04:13:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2022-04-28 04:13:22,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2022-04-28 04:13:22,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:22,793 INFO L225 Difference]: With dead ends: 132 [2022-04-28 04:13:22,793 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 04:13:22,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 32 SyntacticMatches, 26 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=555, Invalid=8001, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 04:13:22,794 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 183 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4225 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 4225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:22,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 153 Invalid, 4370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 4225 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 04:13:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 04:13:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2022-04-28 04:13:22,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:22,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:22,860 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:22,860 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:22,862 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-04-28 04:13:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-04-28 04:13:22,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:22,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:22,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 121 states. [2022-04-28 04:13:22,862 INFO L87 Difference]: Start difference. First operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 121 states. [2022-04-28 04:13:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:22,864 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-04-28 04:13:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-04-28 04:13:22,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:22,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:22,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:22,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-04-28 04:13:22,866 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 103 [2022-04-28 04:13:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:22,866 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-04-28 04:13:22,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:22,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 111 transitions. [2022-04-28 04:13:23,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-04-28 04:13:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 04:13:23,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:23,145 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:23,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-28 04:13:23,145 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2033230097, now seen corresponding path program 41 times [2022-04-28 04:13:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:23,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [280508448] [2022-04-28 04:13:24,031 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:26,539 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:26,589 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:26,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:28,906 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:28,959 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:29,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:31,210 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:31,432 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:31,432 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1742511747, now seen corresponding path program 1 times [2022-04-28 04:13:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:31,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377423209] [2022-04-28 04:13:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:31,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {22950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {22944#true} is VALID [2022-04-28 04:13:31,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {22944#true} assume true; {22944#true} is VALID [2022-04-28 04:13:31,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22944#true} {22944#true} #68#return; {22944#true} is VALID [2022-04-28 04:13:31,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {22944#true} call ULTIMATE.init(); {22950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:31,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {22950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {22944#true} is VALID [2022-04-28 04:13:31,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {22944#true} assume true; {22944#true} is VALID [2022-04-28 04:13:31,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22944#true} {22944#true} #68#return; {22944#true} is VALID [2022-04-28 04:13:31,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {22944#true} call #t~ret8 := main(); {22944#true} is VALID [2022-04-28 04:13:31,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {22944#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {22949#(= main_~a~0 0)} is VALID [2022-04-28 04:13:31,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {22949#(= main_~a~0 0)} [158] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_3196| |v_main_#t~pre7_3160|)) (.cse1 (= |v_main_#t~pre4_219| |v_main_#t~pre4_218|)) (.cse2 (= v_main_~a~0_268 v_main_~a~0_267)) (.cse3 (= v_main_~b~0_364 v_main_~b~0_362)) (.cse4 (= v_main_~c~0_1474 v_main_~c~0_1467)) (.cse5 (= v_main_~d~0_4651 v_main_~d~0_4609)) (.cse6 (= |v_main_#t~pre5_267| |v_main_#t~pre5_266|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1121| |v_main_#t~pre6_1127|) .cse5 .cse6) (and (= |v_main_#t~pre6_1127| |v_main_#t~pre6_1121|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_3196|, main_~c~0=v_main_~c~0_1474, main_~d~0=v_main_~d~0_4651, main_~b~0=v_main_~b~0_364, main_#t~pre4=|v_main_#t~pre4_219|, main_#t~pre5=|v_main_#t~pre5_267|, main_~a~0=v_main_~a~0_268, main_#t~pre6=|v_main_#t~pre6_1127|} OutVars{main_#t~pre7=|v_main_#t~pre7_3160|, main_~c~0=v_main_~c~0_1467, main_~d~0=v_main_~d~0_4609, main_~b~0=v_main_~b~0_362, main_#t~pre4=|v_main_#t~pre4_218|, main_#t~pre5=|v_main_#t~pre5_266|, main_~a~0=v_main_~a~0_267, main_#t~pre6=|v_main_#t~pre6_1121|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {22949#(= main_~a~0 0)} is VALID [2022-04-28 04:13:31,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {22949#(= main_~a~0 0)} [157] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {22945#false} is VALID [2022-04-28 04:13:31,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {22945#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {22945#false} is VALID [2022-04-28 04:13:31,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {22945#false} assume !false; {22945#false} is VALID [2022-04-28 04:13:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:13:31,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:31,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377423209] [2022-04-28 04:13:31,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377423209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:31,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:31,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:33,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [280508448] [2022-04-28 04:13:33,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [280508448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:33,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:33,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 04:13:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015157325] [2022-04-28 04:13:33,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 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 105 [2022-04-28 04:13:33,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:33,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:33,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:33,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 04:13:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:33,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 04:13:33,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2256, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 04:13:33,144 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:39,909 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-04-28 04:13:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 04:13:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 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 105 [2022-04-28 04:13:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 141 transitions. [2022-04-28 04:13:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 141 transitions. [2022-04-28 04:13:39,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 141 transitions. [2022-04-28 04:13:40,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:40,018 INFO L225 Difference]: With dead ends: 130 [2022-04-28 04:13:40,018 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 04:13:40,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 42 SyntacticMatches, 16 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1725 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=576, Invalid=8736, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 04:13:40,019 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 125 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 4455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:40,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 212 Invalid, 4455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 04:13:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 04:13:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-28 04:13:40,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:40,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:40,080 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:40,080 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:40,081 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-28 04:13:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-28 04:13:40,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:40,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:40,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 119 states. [2022-04-28 04:13:40,081 INFO L87 Difference]: Start difference. First operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 119 states. [2022-04-28 04:13:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:40,083 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-28 04:13:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-28 04:13:40,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:40,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:40,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:40,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2022-04-28 04:13:40,085 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 105 [2022-04-28 04:13:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:40,085 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2022-04-28 04:13:40,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:40,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 115 transitions. [2022-04-28 04:13:40,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2022-04-28 04:13:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 04:13:40,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:40,364 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:40,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-28 04:13:40,364 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash 326718754, now seen corresponding path program 42 times [2022-04-28 04:13:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:40,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1276082351] [2022-04-28 04:13:41,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:44,853 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:44,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:44,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:49,085 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:49,138 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:49,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:51,394 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:51,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:51,621 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:51,621 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1742573251, now seen corresponding path program 1 times [2022-04-28 04:13:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:51,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689867742] [2022-04-28 04:13:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:51,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {23821#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23815#true} is VALID [2022-04-28 04:13:51,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {23815#true} assume true; {23815#true} is VALID [2022-04-28 04:13:51,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23815#true} {23815#true} #68#return; {23815#true} is VALID [2022-04-28 04:13:51,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {23815#true} call ULTIMATE.init(); {23821#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:51,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {23821#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23815#true} is VALID [2022-04-28 04:13:51,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {23815#true} assume true; {23815#true} is VALID [2022-04-28 04:13:51,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23815#true} {23815#true} #68#return; {23815#true} is VALID [2022-04-28 04:13:51,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {23815#true} call #t~ret8 := main(); {23815#true} is VALID [2022-04-28 04:13:51,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {23815#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {23820#(= main_~a~0 0)} is VALID [2022-04-28 04:13:51,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {23820#(= main_~a~0 0)} [160] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_276| |v_main_#t~pre5_274|)) (.cse1 (= v_main_~b~0_378 v_main_~b~0_375)) (.cse2 (= |v_main_#t~pre7_3311| |v_main_#t~pre7_3275|)) (.cse3 (= |v_main_#t~pre6_1161| |v_main_#t~pre6_1155|)) (.cse4 (= v_main_~a~0_274 v_main_~a~0_273)) (.cse5 (= |v_main_#t~pre4_224| |v_main_#t~pre4_223|)) (.cse6 (= v_main_~d~0_4826 v_main_~d~0_4784))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~c~0_1523 v_main_~c~0_1515)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_1515 v_main_~c~0_1523) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_3311|, main_~c~0=v_main_~c~0_1523, main_~d~0=v_main_~d~0_4826, main_~b~0=v_main_~b~0_378, main_#t~pre4=|v_main_#t~pre4_224|, main_#t~pre5=|v_main_#t~pre5_276|, main_~a~0=v_main_~a~0_274, main_#t~pre6=|v_main_#t~pre6_1161|} OutVars{main_#t~pre7=|v_main_#t~pre7_3275|, main_~c~0=v_main_~c~0_1515, main_~d~0=v_main_~d~0_4784, main_~b~0=v_main_~b~0_375, main_#t~pre4=|v_main_#t~pre4_223|, main_#t~pre5=|v_main_#t~pre5_274|, main_~a~0=v_main_~a~0_273, main_#t~pre6=|v_main_#t~pre6_1155|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {23820#(= main_~a~0 0)} is VALID [2022-04-28 04:13:51,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {23820#(= main_~a~0 0)} [159] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {23816#false} is VALID [2022-04-28 04:13:51,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {23816#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {23816#false} is VALID [2022-04-28 04:13:51,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {23816#false} assume !false; {23816#false} is VALID [2022-04-28 04:13:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:13:51,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:51,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689867742] [2022-04-28 04:13:51,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689867742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:51,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:51,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:53,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:53,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1276082351] [2022-04-28 04:13:53,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1276082351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:53,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:53,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 04:13:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065120116] [2022-04-28 04:13:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:53,447 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 108 [2022-04-28 04:13:53,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:53,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:53,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:53,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 04:13:53,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:53,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 04:13:53,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2353, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 04:13:53,534 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:59,774 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-04-28 04:13:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 04:13:59,774 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 108 [2022-04-28 04:13:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 141 transitions. [2022-04-28 04:13:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 141 transitions. [2022-04-28 04:13:59,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 141 transitions. [2022-04-28 04:13:59,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:59,882 INFO L225 Difference]: With dead ends: 131 [2022-04-28 04:13:59,882 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 04:13:59,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 35 SyntacticMatches, 25 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=585, Invalid=9117, Unknown=0, NotChecked=0, Total=9702 [2022-04-28 04:13:59,883 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 133 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:59,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 52 Invalid, 4070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 04:13:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 04:13:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2022-04-28 04:13:59,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:59,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:59,942 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:59,942 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:59,943 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-04-28 04:13:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-04-28 04:13:59,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:59,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:59,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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 120 states. [2022-04-28 04:13:59,943 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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 120 states. [2022-04-28 04:13:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:59,944 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-04-28 04:13:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-04-28 04:13:59,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:59,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:59,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:59,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2022-04-28 04:13:59,946 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 108 [2022-04-28 04:13:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:59,946 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2022-04-28 04:13:59,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:13:59,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 116 transitions. [2022-04-28 04:14:00,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-28 04:14:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 04:14:00,218 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:00,219 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:00,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-28 04:14:00,219 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 751982443, now seen corresponding path program 43 times [2022-04-28 04:14:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:00,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1784417276] [2022-04-28 04:14:01,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:05,241 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:05,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:05,382 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:07,536 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:07,635 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:11,717 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:11,761 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:11,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:11,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:11,920 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:11,920 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:12,123 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:12,123 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1742634755, now seen corresponding path program 1 times [2022-04-28 04:14:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:12,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149564987] [2022-04-28 04:14:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:12,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:12,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {24701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {24695#true} is VALID [2022-04-28 04:14:12,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {24695#true} assume true; {24695#true} is VALID [2022-04-28 04:14:12,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24695#true} {24695#true} #68#return; {24695#true} is VALID [2022-04-28 04:14:12,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {24695#true} call ULTIMATE.init(); {24701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:12,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {24701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {24695#true} is VALID [2022-04-28 04:14:12,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {24695#true} assume true; {24695#true} is VALID [2022-04-28 04:14:12,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24695#true} {24695#true} #68#return; {24695#true} is VALID [2022-04-28 04:14:12,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {24695#true} call #t~ret8 := main(); {24695#true} is VALID [2022-04-28 04:14:12,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {24695#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {24700#(= main_~a~0 0)} is VALID [2022-04-28 04:14:12,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {24700#(= main_~a~0 0)} [162] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1592 v_main_~c~0_1583)) (.cse1 (= |v_main_#t~pre5_291| |v_main_#t~pre5_289|)) (.cse2 (= v_main_~d~0_5012 v_main_~d~0_4969)) (.cse3 (= |v_main_#t~pre6_1205| |v_main_#t~pre6_1198|)) (.cse4 (= v_main_~b~0_399 v_main_~b~0_396)) (.cse5 (= |v_main_#t~pre4_229| |v_main_#t~pre4_228|))) (or (and .cse0 (= v_main_~a~0_280 v_main_~a~0_279) .cse1 .cse2 .cse3 (= |v_main_#t~pre7_3427| |v_main_#t~pre7_3391|) .cse4 .cse5) (and .cse0 (= v_main_~a~0_279 v_main_~a~0_280) .cse1 .cse2 .cse3 (= |v_main_#t~pre7_3391| |v_main_#t~pre7_3427|) .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_3427|, main_~c~0=v_main_~c~0_1592, main_~d~0=v_main_~d~0_5012, main_~b~0=v_main_~b~0_399, main_#t~pre4=|v_main_#t~pre4_229|, main_#t~pre5=|v_main_#t~pre5_291|, main_~a~0=v_main_~a~0_280, main_#t~pre6=|v_main_#t~pre6_1205|} OutVars{main_#t~pre7=|v_main_#t~pre7_3391|, main_~c~0=v_main_~c~0_1583, main_~d~0=v_main_~d~0_4969, main_~b~0=v_main_~b~0_396, main_#t~pre4=|v_main_#t~pre4_228|, main_#t~pre5=|v_main_#t~pre5_289|, main_~a~0=v_main_~a~0_279, main_#t~pre6=|v_main_#t~pre6_1198|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {24700#(= main_~a~0 0)} is VALID [2022-04-28 04:14:12,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {24700#(= main_~a~0 0)} [161] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {24696#false} is VALID [2022-04-28 04:14:12,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {24696#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {24696#false} is VALID [2022-04-28 04:14:12,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {24696#false} assume !false; {24696#false} is VALID [2022-04-28 04:14:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:12,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149564987] [2022-04-28 04:14:12,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149564987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:12,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:12,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:13,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:13,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1784417276] [2022-04-28 04:14:13,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1784417276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:13,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:13,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 04:14:13,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412877776] [2022-04-28 04:14:13,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:13,835 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 111 [2022-04-28 04:14:13,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:13,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:13,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:13,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 04:14:13,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 04:14:13,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2452, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 04:14:13,923 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:20,072 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-04-28 04:14:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 04:14:20,072 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 111 [2022-04-28 04:14:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 143 transitions. [2022-04-28 04:14:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 143 transitions. [2022-04-28 04:14:20,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 143 transitions. [2022-04-28 04:14:20,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:20,184 INFO L225 Difference]: With dead ends: 133 [2022-04-28 04:14:20,184 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 04:14:20,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 40 SyntacticMatches, 22 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=594, Invalid=9506, Unknown=0, NotChecked=0, Total=10100 [2022-04-28 04:14:20,185 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 136 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3896 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 4006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:20,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 42 Invalid, 4006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3896 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 04:14:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 04:14:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2022-04-28 04:14:20,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:20,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:20,250 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:20,250 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:20,251 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2022-04-28 04:14:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2022-04-28 04:14:20,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:20,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:20,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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 122 states. [2022-04-28 04:14:20,252 INFO L87 Difference]: Start difference. First operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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 122 states. [2022-04-28 04:14:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:20,253 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2022-04-28 04:14:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2022-04-28 04:14:20,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:20,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:20,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:20,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2022-04-28 04:14:20,254 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 111 [2022-04-28 04:14:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:20,254 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2022-04-28 04:14:20,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:20,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 117 transitions. [2022-04-28 04:14:20,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2022-04-28 04:14:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 04:14:20,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:20,542 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:20,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-28 04:14:20,542 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1034444425, now seen corresponding path program 44 times [2022-04-28 04:14:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:20,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [109417131] [2022-04-28 04:14:21,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:24,185 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:24,235 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:24,361 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:24,486 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:24,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:24,552 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:24,552 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:14:24,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:24,740 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:24,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1742696259, now seen corresponding path program 1 times [2022-04-28 04:14:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:24,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568863206] [2022-04-28 04:14:24,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:24,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:24,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {25594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25588#true} is VALID [2022-04-28 04:14:24,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {25588#true} assume true; {25588#true} is VALID [2022-04-28 04:14:24,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25588#true} {25588#true} #68#return; {25588#true} is VALID [2022-04-28 04:14:24,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {25588#true} call ULTIMATE.init(); {25594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:24,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {25594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25588#true} is VALID [2022-04-28 04:14:24,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {25588#true} assume true; {25588#true} is VALID [2022-04-28 04:14:24,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25588#true} {25588#true} #68#return; {25588#true} is VALID [2022-04-28 04:14:24,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {25588#true} call #t~ret8 := main(); {25588#true} is VALID [2022-04-28 04:14:24,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {25588#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {25593#(= main_~a~0 0)} is VALID [2022-04-28 04:14:24,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {25593#(= main_~a~0 0)} [164] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_234| |v_main_#t~pre4_233|)) (.cse1 (= |v_main_#t~pre5_312| |v_main_#t~pre5_310|)) (.cse2 (= v_main_~a~0_286 v_main_~a~0_285)) (.cse3 (= v_main_~b~0_427 v_main_~b~0_424)) (.cse4 (= |v_main_#t~pre7_3537| |v_main_#t~pre7_3500|)) (.cse5 (= v_main_~d~0_5190 v_main_~d~0_5146))) (or (and .cse0 (= |v_main_#t~pre6_1238| |v_main_#t~pre6_1245|) .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_1650 v_main_~c~0_1659) .cse5) (and .cse0 (= v_main_~c~0_1659 v_main_~c~0_1650) .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1245| |v_main_#t~pre6_1238|) .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_3537|, main_~c~0=v_main_~c~0_1659, main_~d~0=v_main_~d~0_5190, main_~b~0=v_main_~b~0_427, main_#t~pre4=|v_main_#t~pre4_234|, main_#t~pre5=|v_main_#t~pre5_312|, main_~a~0=v_main_~a~0_286, main_#t~pre6=|v_main_#t~pre6_1245|} OutVars{main_#t~pre7=|v_main_#t~pre7_3500|, main_~c~0=v_main_~c~0_1650, main_~d~0=v_main_~d~0_5146, main_~b~0=v_main_~b~0_424, main_#t~pre4=|v_main_#t~pre4_233|, main_#t~pre5=|v_main_#t~pre5_310|, main_~a~0=v_main_~a~0_285, main_#t~pre6=|v_main_#t~pre6_1238|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {25593#(= main_~a~0 0)} is VALID [2022-04-28 04:14:24,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {25593#(= main_~a~0 0)} [163] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {25589#false} is VALID [2022-04-28 04:14:24,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {25589#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {25589#false} is VALID [2022-04-28 04:14:24,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#false} assume !false; {25589#false} is VALID [2022-04-28 04:14:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:24,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:24,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568863206] [2022-04-28 04:14:24,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568863206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:24,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:24,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:26,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:26,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [109417131] [2022-04-28 04:14:26,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [109417131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:26,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:26,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 04:14:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002166532] [2022-04-28 04:14:26,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:26,631 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 113 [2022-04-28 04:14:26,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:26,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:26,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:26,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 04:14:26,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:26,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 04:14:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2553, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 04:14:26,725 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:33,580 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-04-28 04:14:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 04:14:33,580 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 113 [2022-04-28 04:14:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 145 transitions. [2022-04-28 04:14:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 145 transitions. [2022-04-28 04:14:33,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 145 transitions. [2022-04-28 04:14:33,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:33,729 INFO L225 Difference]: With dead ends: 135 [2022-04-28 04:14:33,729 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 04:14:33,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 38 SyntacticMatches, 25 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=603, Invalid=9903, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 04:14:33,731 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 138 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4374 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 4374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:33,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 32 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 4374 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 04:14:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 04:14:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2022-04-28 04:14:33,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:33,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:33,819 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:33,820 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:33,821 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2022-04-28 04:14:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-04-28 04:14:33,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:33,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:33,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 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 124 states. [2022-04-28 04:14:33,822 INFO L87 Difference]: Start difference. First operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 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 124 states. [2022-04-28 04:14:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:33,823 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2022-04-28 04:14:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-04-28 04:14:33,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:33,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:33,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:33,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2022-04-28 04:14:33,828 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 113 [2022-04-28 04:14:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:33,828 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2022-04-28 04:14:33,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:33,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 119 transitions. [2022-04-28 04:14:34,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-28 04:14:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 04:14:34,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:34,155 INFO L195 NwaCegarLoop]: trace histogram [38, 38, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:34,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-28 04:14:34,156 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1897469479, now seen corresponding path program 45 times [2022-04-28 04:14:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:34,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459537839] [2022-04-28 04:14:35,114 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:35,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:35,359 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:35,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:35,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:35,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:35,987 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:35,988 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1742757763, now seen corresponding path program 1 times [2022-04-28 04:14:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:35,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177988459] [2022-04-28 04:14:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:36,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {26502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {26496#true} is VALID [2022-04-28 04:14:36,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {26496#true} assume true; {26496#true} is VALID [2022-04-28 04:14:36,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26496#true} {26496#true} #68#return; {26496#true} is VALID [2022-04-28 04:14:36,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {26496#true} call ULTIMATE.init(); {26502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:36,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {26502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {26496#true} is VALID [2022-04-28 04:14:36,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {26496#true} assume true; {26496#true} is VALID [2022-04-28 04:14:36,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26496#true} {26496#true} #68#return; {26496#true} is VALID [2022-04-28 04:14:36,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {26496#true} call #t~ret8 := main(); {26496#true} is VALID [2022-04-28 04:14:36,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {26496#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {26501#(= main_~a~0 0)} is VALID [2022-04-28 04:14:36,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {26501#(= main_~a~0 0)} [166] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_3659| |v_main_#t~pre7_3621|)) (.cse1 (= |v_main_#t~pre6_1289| |v_main_#t~pre6_1282|)) (.cse2 (= v_main_~b~0_455 v_main_~b~0_452)) (.cse3 (= v_main_~a~0_292 v_main_~a~0_291)) (.cse4 (= |v_main_#t~pre5_333| |v_main_#t~pre5_331|)) (.cse5 (= |v_main_#t~pre4_239| |v_main_#t~pre4_238|)) (.cse6 (= v_main_~d~0_5381 v_main_~d~0_5336))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_1724 v_main_~c~0_1715) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_1715 v_main_~c~0_1724) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_3659|, main_~c~0=v_main_~c~0_1724, main_~d~0=v_main_~d~0_5381, main_~b~0=v_main_~b~0_455, main_#t~pre4=|v_main_#t~pre4_239|, main_#t~pre5=|v_main_#t~pre5_333|, main_~a~0=v_main_~a~0_292, main_#t~pre6=|v_main_#t~pre6_1289|} OutVars{main_#t~pre7=|v_main_#t~pre7_3621|, main_~c~0=v_main_~c~0_1715, main_~d~0=v_main_~d~0_5336, main_~b~0=v_main_~b~0_452, main_#t~pre4=|v_main_#t~pre4_238|, main_#t~pre5=|v_main_#t~pre5_331|, main_~a~0=v_main_~a~0_291, main_#t~pre6=|v_main_#t~pre6_1282|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {26501#(= main_~a~0 0)} is VALID [2022-04-28 04:14:36,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {26501#(= main_~a~0 0)} [165] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {26497#false} is VALID [2022-04-28 04:14:36,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {26497#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {26497#false} is VALID [2022-04-28 04:14:36,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {26497#false} assume !false; {26497#false} is VALID [2022-04-28 04:14:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:36,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:36,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177988459] [2022-04-28 04:14:36,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177988459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:36,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:36,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:37,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:37,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1459537839] [2022-04-28 04:14:37,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1459537839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:37,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:37,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 04:14:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726667736] [2022-04-28 04:14:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 115 [2022-04-28 04:14:37,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:37,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:37,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:38,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 04:14:38,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:38,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 04:14:38,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2656, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 04:14:38,000 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:45,445 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2022-04-28 04:14:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 04:14:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 115 [2022-04-28 04:14:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 147 transitions. [2022-04-28 04:14:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 147 transitions. [2022-04-28 04:14:45,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 147 transitions. [2022-04-28 04:14:45,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:45,569 INFO L225 Difference]: With dead ends: 137 [2022-04-28 04:14:45,569 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 04:14:45,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 35 SyntacticMatches, 29 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=612, Invalid=10308, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 04:14:45,570 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 185 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 4725 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 4725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:45,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 52 Invalid, 4886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 4725 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 04:14:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 04:14:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2022-04-28 04:14:45,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:45,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:45,629 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:45,629 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:45,630 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2022-04-28 04:14:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2022-04-28 04:14:45,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:45,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:45,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 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 126 states. [2022-04-28 04:14:45,631 INFO L87 Difference]: Start difference. First operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 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 126 states. [2022-04-28 04:14:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:45,632 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2022-04-28 04:14:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2022-04-28 04:14:45,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:45,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:45,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:45,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-28 04:14:45,633 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 115 [2022-04-28 04:14:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:45,634 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-28 04:14:45,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:45,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-28 04:14:45,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 04:14:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 04:14:45,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:45,969 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:45,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-28 04:14:45,969 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1959109051, now seen corresponding path program 46 times [2022-04-28 04:14:45,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:45,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855269029] [2022-04-28 04:14:46,921 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,030 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,150 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,281 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,401 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,755 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,755 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1742819267, now seen corresponding path program 1 times [2022-04-28 04:14:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129754697] [2022-04-28 04:14:47,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:47,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:47,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {27425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {27419#true} is VALID [2022-04-28 04:14:47,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {27419#true} assume true; {27419#true} is VALID [2022-04-28 04:14:47,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27419#true} {27419#true} #68#return; {27419#true} is VALID [2022-04-28 04:14:47,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {27419#true} call ULTIMATE.init(); {27425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:47,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {27425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {27419#true} is VALID [2022-04-28 04:14:47,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {27419#true} assume true; {27419#true} is VALID [2022-04-28 04:14:47,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27419#true} {27419#true} #68#return; {27419#true} is VALID [2022-04-28 04:14:47,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {27419#true} call #t~ret8 := main(); {27419#true} is VALID [2022-04-28 04:14:47,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {27419#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {27424#(= main_~a~0 0)} is VALID [2022-04-28 04:14:47,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {27424#(= main_~a~0 0)} [168] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_483 v_main_~b~0_480)) (.cse1 (= v_main_~d~0_5576 v_main_~d~0_5530)) (.cse2 (= |v_main_#t~pre4_244| |v_main_#t~pre4_243|)) (.cse3 (= v_main_~a~0_298 v_main_~a~0_297)) (.cse4 (= |v_main_#t~pre5_354| |v_main_#t~pre5_352|)) (.cse5 (= |v_main_#t~pre7_3784| |v_main_#t~pre7_3745|))) (or (and .cse0 .cse1 (= v_main_~c~0_1789 v_main_~c~0_1780) .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre6_1333| |v_main_#t~pre6_1326|)) (and .cse0 (= v_main_~c~0_1780 v_main_~c~0_1789) .cse1 (= |v_main_#t~pre6_1326| |v_main_#t~pre6_1333|) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_3784|, main_~c~0=v_main_~c~0_1789, main_~d~0=v_main_~d~0_5576, main_~b~0=v_main_~b~0_483, main_#t~pre4=|v_main_#t~pre4_244|, main_#t~pre5=|v_main_#t~pre5_354|, main_~a~0=v_main_~a~0_298, main_#t~pre6=|v_main_#t~pre6_1333|} OutVars{main_#t~pre7=|v_main_#t~pre7_3745|, main_~c~0=v_main_~c~0_1780, main_~d~0=v_main_~d~0_5530, main_~b~0=v_main_~b~0_480, main_#t~pre4=|v_main_#t~pre4_243|, main_#t~pre5=|v_main_#t~pre5_352|, main_~a~0=v_main_~a~0_297, main_#t~pre6=|v_main_#t~pre6_1326|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {27424#(= main_~a~0 0)} is VALID [2022-04-28 04:14:47,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {27424#(= main_~a~0 0)} [167] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {27420#false} is VALID [2022-04-28 04:14:47,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {27420#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {27420#false} is VALID [2022-04-28 04:14:47,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {27420#false} assume !false; {27420#false} is VALID [2022-04-28 04:14:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:47,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:47,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129754697] [2022-04-28 04:14:47,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129754697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:47,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:47,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:49,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:49,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855269029] [2022-04-28 04:14:49,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855269029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:49,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:49,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 04:14:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48479556] [2022-04-28 04:14:49,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:49,821 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 117 [2022-04-28 04:14:49,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:49,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:49,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:49,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 04:14:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:49,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 04:14:49,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 04:14:49,905 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:57,454 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2022-04-28 04:14:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 04:14:57,454 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 117 [2022-04-28 04:14:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 149 transitions. [2022-04-28 04:14:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 149 transitions. [2022-04-28 04:14:57,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 149 transitions. [2022-04-28 04:14:57,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:57,567 INFO L225 Difference]: With dead ends: 139 [2022-04-28 04:14:57,567 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 04:14:57,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 39 SyntacticMatches, 26 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=621, Invalid=10721, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 04:14:57,568 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 171 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4770 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 4921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 4770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:57,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 107 Invalid, 4921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 4770 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 04:14:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 04:14:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2022-04-28 04:14:57,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:57,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:57,631 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:57,631 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:57,632 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-04-28 04:14:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-04-28 04:14:57,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:57,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:57,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 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 128 states. [2022-04-28 04:14:57,632 INFO L87 Difference]: Start difference. First operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 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 128 states. [2022-04-28 04:14:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:57,633 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-04-28 04:14:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-04-28 04:14:57,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:57,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:57,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:57,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2022-04-28 04:14:57,635 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 117 [2022-04-28 04:14:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:57,635 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2022-04-28 04:14:57,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:57,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 123 transitions. [2022-04-28 04:14:57,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2022-04-28 04:14:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 04:14:57,930 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:57,931 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:57,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-28 04:14:57,931 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1574299933, now seen corresponding path program 47 times [2022-04-28 04:14:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:57,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1228434328] [2022-04-28 04:14:58,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,992 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:03,043 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:03,164 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:03,292 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:07,381 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:07,432 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:07,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:07,830 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:07,830 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1742880771, now seen corresponding path program 1 times [2022-04-28 04:15:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:07,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552080845] [2022-04-28 04:15:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:07,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:07,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {28363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {28357#true} is VALID [2022-04-28 04:15:07,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {28357#true} assume true; {28357#true} is VALID [2022-04-28 04:15:07,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28357#true} {28357#true} #68#return; {28357#true} is VALID [2022-04-28 04:15:07,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {28357#true} call ULTIMATE.init(); {28363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:07,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {28363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {28357#true} is VALID [2022-04-28 04:15:07,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {28357#true} assume true; {28357#true} is VALID [2022-04-28 04:15:07,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28357#true} {28357#true} #68#return; {28357#true} is VALID [2022-04-28 04:15:07,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {28357#true} call #t~ret8 := main(); {28357#true} is VALID [2022-04-28 04:15:07,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {28357#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {28362#(= main_~a~0 0)} is VALID [2022-04-28 04:15:07,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {28362#(= main_~a~0 0)} [170] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_304 v_main_~a~0_303)) (.cse1 (= |v_main_#t~pre7_3912| |v_main_#t~pre7_3872|)) (.cse2 (= |v_main_#t~pre4_249| |v_main_#t~pre4_248|)) (.cse3 (= v_main_~d~0_5775 v_main_~d~0_5728)) (.cse4 (= |v_main_#t~pre5_375| |v_main_#t~pre5_373|)) (.cse5 (= v_main_~c~0_1854 v_main_~c~0_1845)) (.cse6 (= |v_main_#t~pre6_1377| |v_main_#t~pre6_1370|))) (or (and .cse0 (= v_main_~b~0_511 v_main_~b~0_508) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~b~0_508 v_main_~b~0_511) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_3912|, main_~c~0=v_main_~c~0_1854, main_~d~0=v_main_~d~0_5775, main_~b~0=v_main_~b~0_511, main_#t~pre4=|v_main_#t~pre4_249|, main_#t~pre5=|v_main_#t~pre5_375|, main_~a~0=v_main_~a~0_304, main_#t~pre6=|v_main_#t~pre6_1377|} OutVars{main_#t~pre7=|v_main_#t~pre7_3872|, main_~c~0=v_main_~c~0_1845, main_~d~0=v_main_~d~0_5728, main_~b~0=v_main_~b~0_508, main_#t~pre4=|v_main_#t~pre4_248|, main_#t~pre5=|v_main_#t~pre5_373|, main_~a~0=v_main_~a~0_303, main_#t~pre6=|v_main_#t~pre6_1370|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {28362#(= main_~a~0 0)} is VALID [2022-04-28 04:15:07,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {28362#(= main_~a~0 0)} [169] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {28358#false} is VALID [2022-04-28 04:15:07,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {28358#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {28358#false} is VALID [2022-04-28 04:15:07,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {28358#false} assume !false; {28358#false} is VALID [2022-04-28 04:15:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:15:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:07,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552080845] [2022-04-28 04:15:07,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552080845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:07,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:07,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:09,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1228434328] [2022-04-28 04:15:09,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1228434328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:09,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:09,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 04:15:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903661468] [2022-04-28 04:15:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:09,893 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 119 [2022-04-28 04:15:09,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:09,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:09,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:09,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 04:15:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:09,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 04:15:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2868, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 04:15:09,979 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:17,632 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2022-04-28 04:15:17,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 04:15:17,632 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 119 [2022-04-28 04:15:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 151 transitions. [2022-04-28 04:15:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 151 transitions. [2022-04-28 04:15:17,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 151 transitions. [2022-04-28 04:15:17,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:17,749 INFO L225 Difference]: With dead ends: 141 [2022-04-28 04:15:17,749 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 04:15:17,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 38 SyntacticMatches, 28 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=630, Invalid=11142, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 04:15:17,750 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 135 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4900 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 5012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 4900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:17,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 167 Invalid, 5012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 4900 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 04:15:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 04:15:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2022-04-28 04:15:17,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:17,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:17,816 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:17,816 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:17,817 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2022-04-28 04:15:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-04-28 04:15:17,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:17,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:17,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 130 states. [2022-04-28 04:15:17,817 INFO L87 Difference]: Start difference. First operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 130 states. [2022-04-28 04:15:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:17,818 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2022-04-28 04:15:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-04-28 04:15:17,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:17,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:17,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:17,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2022-04-28 04:15:17,820 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 119 [2022-04-28 04:15:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:17,820 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2022-04-28 04:15:17,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:17,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 125 transitions. [2022-04-28 04:15:18,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2022-04-28 04:15:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 04:15:18,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:18,154 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:18,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-28 04:15:18,155 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1139924991, now seen corresponding path program 48 times [2022-04-28 04:15:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:18,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006601247] [2022-04-28 04:15:19,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:23,287 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:23,338 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:23,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:23,584 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:27,664 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:27,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:27,822 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:28,049 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:28,050 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1742942275, now seen corresponding path program 1 times [2022-04-28 04:15:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:28,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955656137] [2022-04-28 04:15:28,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:28,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:28,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {29316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {29310#true} is VALID [2022-04-28 04:15:28,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {29310#true} assume true; {29310#true} is VALID [2022-04-28 04:15:28,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29310#true} {29310#true} #68#return; {29310#true} is VALID [2022-04-28 04:15:28,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {29310#true} call ULTIMATE.init(); {29316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:28,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {29316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {29310#true} is VALID [2022-04-28 04:15:28,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {29310#true} assume true; {29310#true} is VALID [2022-04-28 04:15:28,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29310#true} {29310#true} #68#return; {29310#true} is VALID [2022-04-28 04:15:28,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {29310#true} call #t~ret8 := main(); {29310#true} is VALID [2022-04-28 04:15:28,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {29310#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {29315#(= main_~a~0 0)} is VALID [2022-04-28 04:15:28,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {29315#(= main_~a~0 0)} [172] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_4043| |v_main_#t~pre7_4002|)) (.cse1 (= |v_main_#t~pre4_254| |v_main_#t~pre4_253|)) (.cse2 (= v_main_~d~0_5978 v_main_~d~0_5930)) (.cse3 (= v_main_~c~0_1919 v_main_~c~0_1910)) (.cse4 (= v_main_~b~0_539 v_main_~b~0_536)) (.cse5 (= |v_main_#t~pre5_396| |v_main_#t~pre5_394|))) (or (and .cse0 (= |v_main_#t~pre6_1421| |v_main_#t~pre6_1414|) .cse1 .cse2 .cse3 .cse4 (= v_main_~a~0_310 v_main_~a~0_309) .cse5) (and .cse0 .cse1 (= v_main_~a~0_309 v_main_~a~0_310) .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1414| |v_main_#t~pre6_1421|) .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4043|, main_~c~0=v_main_~c~0_1919, main_~d~0=v_main_~d~0_5978, main_~b~0=v_main_~b~0_539, main_#t~pre4=|v_main_#t~pre4_254|, main_#t~pre5=|v_main_#t~pre5_396|, main_~a~0=v_main_~a~0_310, main_#t~pre6=|v_main_#t~pre6_1421|} OutVars{main_#t~pre7=|v_main_#t~pre7_4002|, main_~c~0=v_main_~c~0_1910, main_~d~0=v_main_~d~0_5930, main_~b~0=v_main_~b~0_536, main_#t~pre4=|v_main_#t~pre4_253|, main_#t~pre5=|v_main_#t~pre5_394|, main_~a~0=v_main_~a~0_309, main_#t~pre6=|v_main_#t~pre6_1414|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {29315#(= main_~a~0 0)} is VALID [2022-04-28 04:15:28,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {29315#(= main_~a~0 0)} [171] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {29311#false} is VALID [2022-04-28 04:15:28,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {29311#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {29311#false} is VALID [2022-04-28 04:15:28,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {29311#false} assume !false; {29311#false} is VALID [2022-04-28 04:15:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:15:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:28,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955656137] [2022-04-28 04:15:28,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955656137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:28,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:28,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:29,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:29,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006601247] [2022-04-28 04:15:29,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006601247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:29,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:29,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 04:15:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658574913] [2022-04-28 04:15:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 121 [2022-04-28 04:15:29,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:29,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:29,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:29,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 04:15:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 04:15:29,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2977, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 04:15:29,981 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:38,166 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-04-28 04:15:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 04:15:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 121 [2022-04-28 04:15:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 156 transitions. [2022-04-28 04:15:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 156 transitions. [2022-04-28 04:15:38,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 156 transitions. [2022-04-28 04:15:38,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:38,286 INFO L225 Difference]: With dead ends: 145 [2022-04-28 04:15:38,286 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 04:15:38,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 48 SyntacticMatches, 19 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2749 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=639, Invalid=11571, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 04:15:38,287 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5578 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 5578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:38,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 82 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 5578 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 04:15:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 04:15:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2022-04-28 04:15:38,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:38,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:38,359 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:38,359 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:38,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:38,360 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-04-28 04:15:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-28 04:15:38,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:38,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:38,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 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 134 states. [2022-04-28 04:15:38,360 INFO L87 Difference]: Start difference. First operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 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 134 states. [2022-04-28 04:15:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:38,361 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-04-28 04:15:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-28 04:15:38,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:38,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:38,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:38,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2022-04-28 04:15:38,363 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 121 [2022-04-28 04:15:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:38,363 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2022-04-28 04:15:38,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:38,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 129 transitions. [2022-04-28 04:15:38,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 04:15:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 04:15:38,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:38,702 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:38,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-28 04:15:38,702 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash -317433441, now seen corresponding path program 49 times [2022-04-28 04:15:38,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:38,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826402542] [2022-04-28 04:15:39,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:39,833 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:39,970 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:40,092 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:40,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:40,337 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:40,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:40,565 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1743003779, now seen corresponding path program 1 times [2022-04-28 04:15:40,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:40,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037575471] [2022-04-28 04:15:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:40,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:40,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:40,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {30296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {30290#true} is VALID [2022-04-28 04:15:40,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {30290#true} assume true; {30290#true} is VALID [2022-04-28 04:15:40,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30290#true} {30290#true} #68#return; {30290#true} is VALID [2022-04-28 04:15:40,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {30290#true} call ULTIMATE.init(); {30296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:40,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {30296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {30290#true} is VALID [2022-04-28 04:15:40,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {30290#true} assume true; {30290#true} is VALID [2022-04-28 04:15:40,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30290#true} {30290#true} #68#return; {30290#true} is VALID [2022-04-28 04:15:40,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {30290#true} call #t~ret8 := main(); {30290#true} is VALID [2022-04-28 04:15:40,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {30290#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {30295#(= main_~a~0 0)} is VALID [2022-04-28 04:15:40,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {30295#(= main_~a~0 0)} [174] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_4171| |v_main_#t~pre7_4129|)) (.cse1 (= |v_main_#t~pre5_417| |v_main_#t~pre5_415|)) (.cse2 (= v_main_~a~0_316 v_main_~a~0_315)) (.cse3 (= v_main_~b~0_567 v_main_~b~0_564)) (.cse4 (= v_main_~d~0_6178 v_main_~d~0_6129)) (.cse5 (= |v_main_#t~pre4_259| |v_main_#t~pre4_258|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre6_1457| |v_main_#t~pre6_1464|) .cse3 (= v_main_~c~0_1973 v_main_~c~0_1982) .cse4 .cse5) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre6_1464| |v_main_#t~pre6_1457|) (= v_main_~c~0_1982 v_main_~c~0_1973) .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4171|, main_~c~0=v_main_~c~0_1982, main_~d~0=v_main_~d~0_6178, main_~b~0=v_main_~b~0_567, main_#t~pre4=|v_main_#t~pre4_259|, main_#t~pre5=|v_main_#t~pre5_417|, main_~a~0=v_main_~a~0_316, main_#t~pre6=|v_main_#t~pre6_1464|} OutVars{main_#t~pre7=|v_main_#t~pre7_4129|, main_~c~0=v_main_~c~0_1973, main_~d~0=v_main_~d~0_6129, main_~b~0=v_main_~b~0_564, main_#t~pre4=|v_main_#t~pre4_258|, main_#t~pre5=|v_main_#t~pre5_415|, main_~a~0=v_main_~a~0_315, main_#t~pre6=|v_main_#t~pre6_1457|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {30295#(= main_~a~0 0)} is VALID [2022-04-28 04:15:40,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {30295#(= main_~a~0 0)} [173] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {30291#false} is VALID [2022-04-28 04:15:40,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {30291#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {30291#false} is VALID [2022-04-28 04:15:40,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {30291#false} assume !false; {30291#false} is VALID [2022-04-28 04:15:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:15:40,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:40,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037575471] [2022-04-28 04:15:40,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037575471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:40,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:40,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:42,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:42,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826402542] [2022-04-28 04:15:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826402542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:42,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:42,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 04:15:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235327387] [2022-04-28 04:15:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:42,511 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 123 [2022-04-28 04:15:42,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:42,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:42,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:42,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 04:15:42,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 04:15:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3088, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 04:15:42,595 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:50,213 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-04-28 04:15:50,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 04:15:50,213 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 123 [2022-04-28 04:15:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 156 transitions. [2022-04-28 04:15:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 156 transitions. [2022-04-28 04:15:50,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 156 transitions. [2022-04-28 04:15:50,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:50,333 INFO L225 Difference]: With dead ends: 146 [2022-04-28 04:15:50,333 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 04:15:50,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 46 SyntacticMatches, 22 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2978 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=648, Invalid=12008, Unknown=0, NotChecked=0, Total=12656 [2022-04-28 04:15:50,334 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 139 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5040 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 5158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 5040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:50,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 132 Invalid, 5158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 5040 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 04:15:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 04:15:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2022-04-28 04:15:50,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:50,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:50,401 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:50,401 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:50,403 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2022-04-28 04:15:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2022-04-28 04:15:50,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:50,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:50,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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 135 states. [2022-04-28 04:15:50,403 INFO L87 Difference]: Start difference. First operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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 135 states. [2022-04-28 04:15:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:50,404 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2022-04-28 04:15:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2022-04-28 04:15:50,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:50,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:50,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:50,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2022-04-28 04:15:50,406 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 123 [2022-04-28 04:15:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:50,406 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2022-04-28 04:15:50,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:15:50,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 131 transitions. [2022-04-28 04:15:50,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2022-04-28 04:15:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-28 04:15:50,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:50,748 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:50,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-04-28 04:15:50,749 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:50,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 727819726, now seen corresponding path program 50 times [2022-04-28 04:15:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:50,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857394438] [2022-04-28 04:15:51,700 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:54,393 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:54,436 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:54,552 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:54,682 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:58,761 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:58,804 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:58,918 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:59,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:59,159 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1743065283, now seen corresponding path program 1 times [2022-04-28 04:15:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:59,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986432299] [2022-04-28 04:15:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:59,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {31287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {31281#true} is VALID [2022-04-28 04:15:59,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {31281#true} assume true; {31281#true} is VALID [2022-04-28 04:15:59,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31281#true} {31281#true} #68#return; {31281#true} is VALID [2022-04-28 04:15:59,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {31281#true} call ULTIMATE.init(); {31287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:59,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {31287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {31281#true} is VALID [2022-04-28 04:15:59,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {31281#true} assume true; {31281#true} is VALID [2022-04-28 04:15:59,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31281#true} {31281#true} #68#return; {31281#true} is VALID [2022-04-28 04:15:59,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {31281#true} call #t~ret8 := main(); {31281#true} is VALID [2022-04-28 04:15:59,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {31281#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {31286#(= main_~a~0 0)} is VALID [2022-04-28 04:15:59,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {31286#(= main_~a~0 0)} [176] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_6382 v_main_~d~0_6332)) (.cse1 (= |v_main_#t~pre5_438| |v_main_#t~pre5_436|)) (.cse2 (= v_main_~b~0_595 v_main_~b~0_592)) (.cse3 (= |v_main_#t~pre7_4299| |v_main_#t~pre7_4257|)) (.cse4 (= v_main_~a~0_322 v_main_~a~0_321)) (.cse5 (= |v_main_#t~pre4_264| |v_main_#t~pre4_263|))) (or (and .cse0 .cse1 .cse2 (= v_main_~c~0_2050 v_main_~c~0_2040) .cse3 .cse4 (= |v_main_#t~pre6_1510| |v_main_#t~pre6_1502|) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_2040 v_main_~c~0_2050) (= |v_main_#t~pre6_1502| |v_main_#t~pre6_1510|) .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4299|, main_~c~0=v_main_~c~0_2050, main_~d~0=v_main_~d~0_6382, main_~b~0=v_main_~b~0_595, main_#t~pre4=|v_main_#t~pre4_264|, main_#t~pre5=|v_main_#t~pre5_438|, main_~a~0=v_main_~a~0_322, main_#t~pre6=|v_main_#t~pre6_1510|} OutVars{main_#t~pre7=|v_main_#t~pre7_4257|, main_~c~0=v_main_~c~0_2040, main_~d~0=v_main_~d~0_6332, main_~b~0=v_main_~b~0_592, main_#t~pre4=|v_main_#t~pre4_263|, main_#t~pre5=|v_main_#t~pre5_436|, main_~a~0=v_main_~a~0_321, main_#t~pre6=|v_main_#t~pre6_1502|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {31286#(= main_~a~0 0)} is VALID [2022-04-28 04:15:59,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {31286#(= main_~a~0 0)} [175] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {31282#false} is VALID [2022-04-28 04:15:59,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {31282#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {31282#false} is VALID [2022-04-28 04:15:59,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {31282#false} assume !false; {31282#false} is VALID [2022-04-28 04:15:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:15:59,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986432299] [2022-04-28 04:15:59,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986432299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:59,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:01,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:01,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857394438] [2022-04-28 04:16:01,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857394438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:01,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:01,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 04:16:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672819581] [2022-04-28 04:16:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:01,370 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 126 [2022-04-28 04:16:01,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:01,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:01,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:01,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 04:16:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 04:16:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3201, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 04:16:01,455 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:09,579 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2022-04-28 04:16:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 04:16:09,579 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 126 [2022-04-28 04:16:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 158 transitions. [2022-04-28 04:16:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 158 transitions. [2022-04-28 04:16:09,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 158 transitions. [2022-04-28 04:16:09,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:09,698 INFO L225 Difference]: With dead ends: 148 [2022-04-28 04:16:09,698 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 04:16:09,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 35 SyntacticMatches, 35 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=657, Invalid=12453, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 04:16:09,699 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 179 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5420 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 5420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:09,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 102 Invalid, 5581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 5420 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 04:16:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 04:16:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2022-04-28 04:16:09,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:09,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:09,778 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:09,778 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:09,779 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-04-28 04:16:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2022-04-28 04:16:09,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:09,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:09,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 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 137 states. [2022-04-28 04:16:09,780 INFO L87 Difference]: Start difference. First operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 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 137 states. [2022-04-28 04:16:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:09,781 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-04-28 04:16:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2022-04-28 04:16:09,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:09,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:09,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:09,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-28 04:16:09,782 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 126 [2022-04-28 04:16:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:09,783 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-28 04:16:09,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:09,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 132 transitions. [2022-04-28 04:16:10,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-28 04:16:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 04:16:10,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:10,115 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:10,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-04-28 04:16:10,115 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash -711090132, now seen corresponding path program 51 times [2022-04-28 04:16:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:10,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1567942985] [2022-04-28 04:16:10,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:13,069 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:13,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:13,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:13,360 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:16,494 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:16,546 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:16,663 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:16,921 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:16,921 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1743126787, now seen corresponding path program 1 times [2022-04-28 04:16:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:16,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797875024] [2022-04-28 04:16:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:16,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:16,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {32291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32285#true} is VALID [2022-04-28 04:16:16,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {32285#true} assume true; {32285#true} is VALID [2022-04-28 04:16:16,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32285#true} {32285#true} #68#return; {32285#true} is VALID [2022-04-28 04:16:16,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {32285#true} call ULTIMATE.init(); {32291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:16,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {32291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32285#true} is VALID [2022-04-28 04:16:16,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {32285#true} assume true; {32285#true} is VALID [2022-04-28 04:16:16,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32285#true} {32285#true} #68#return; {32285#true} is VALID [2022-04-28 04:16:16,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {32285#true} call #t~ret8 := main(); {32285#true} is VALID [2022-04-28 04:16:16,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {32285#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {32290#(= main_~a~0 0)} is VALID [2022-04-28 04:16:16,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {32290#(= main_~a~0 0)} [178] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_1556| |v_main_#t~pre6_1548|)) (.cse1 (= |v_main_#t~pre7_4430| |v_main_#t~pre7_4387|)) (.cse2 (= v_main_~d~0_6590 v_main_~d~0_6539)) (.cse3 (= v_main_~a~0_328 v_main_~a~0_327)) (.cse4 (= |v_main_#t~pre5_459| |v_main_#t~pre5_457|)) (.cse5 (= |v_main_#t~pre4_269| |v_main_#t~pre4_268|)) (.cse6 (= v_main_~b~0_623 v_main_~b~0_620))) (or (and .cse0 (= v_main_~c~0_2108 v_main_~c~0_2118) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_2118 v_main_~c~0_2108) .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_4430|, main_~c~0=v_main_~c~0_2118, main_~d~0=v_main_~d~0_6590, main_~b~0=v_main_~b~0_623, main_#t~pre4=|v_main_#t~pre4_269|, main_#t~pre5=|v_main_#t~pre5_459|, main_~a~0=v_main_~a~0_328, main_#t~pre6=|v_main_#t~pre6_1556|} OutVars{main_#t~pre7=|v_main_#t~pre7_4387|, main_~c~0=v_main_~c~0_2108, main_~d~0=v_main_~d~0_6539, main_~b~0=v_main_~b~0_620, main_#t~pre4=|v_main_#t~pre4_268|, main_#t~pre5=|v_main_#t~pre5_457|, main_~a~0=v_main_~a~0_327, main_#t~pre6=|v_main_#t~pre6_1548|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {32290#(= main_~a~0 0)} is VALID [2022-04-28 04:16:16,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {32290#(= main_~a~0 0)} [177] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {32286#false} is VALID [2022-04-28 04:16:16,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {32286#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {32286#false} is VALID [2022-04-28 04:16:16,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {32286#false} assume !false; {32286#false} is VALID [2022-04-28 04:16:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:16:16,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:16,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797875024] [2022-04-28 04:16:16,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797875024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:16,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:16,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:19,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:19,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1567942985] [2022-04-28 04:16:19,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1567942985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:19,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:19,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 04:16:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409602863] [2022-04-28 04:16:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 128 [2022-04-28 04:16:19,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:19,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:19,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:19,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 04:16:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 04:16:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3316, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 04:16:19,231 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:28,425 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2022-04-28 04:16:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 04:16:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 128 [2022-04-28 04:16:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 160 transitions. [2022-04-28 04:16:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 160 transitions. [2022-04-28 04:16:28,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 160 transitions. [2022-04-28 04:16:28,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:28,551 INFO L225 Difference]: With dead ends: 150 [2022-04-28 04:16:28,551 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 04:16:28,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 44 SyntacticMatches, 27 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=666, Invalid=12906, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 04:16:28,553 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 189 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6174 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 6174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:28,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 87 Invalid, 6343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 6174 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 04:16:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 04:16:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2022-04-28 04:16:28,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:28,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:28,641 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:28,641 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:28,642 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-28 04:16:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-28 04:16:28,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:28,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:28,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 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 139 states. [2022-04-28 04:16:28,643 INFO L87 Difference]: Start difference. First operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 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 139 states. [2022-04-28 04:16:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:28,644 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-28 04:16:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-28 04:16:28,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:28,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:28,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:28,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2022-04-28 04:16:28,646 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 128 [2022-04-28 04:16:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:28,646 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2022-04-28 04:16:28,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:28,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 134 transitions. [2022-04-28 04:16:28,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-28 04:16:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 04:16:28,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:28,996 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:28,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-04-28 04:16:28,996 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash -523994358, now seen corresponding path program 52 times [2022-04-28 04:16:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:28,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118295027] [2022-04-28 04:16:29,909 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:33,988 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:34,030 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:34,144 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:34,263 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:38,344 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:38,387 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:38,501 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:38,733 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:38,734 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:38,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1743188291, now seen corresponding path program 1 times [2022-04-28 04:16:38,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:38,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548775460] [2022-04-28 04:16:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:38,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {33310#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {33304#true} is VALID [2022-04-28 04:16:38,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {33304#true} assume true; {33304#true} is VALID [2022-04-28 04:16:38,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33304#true} {33304#true} #68#return; {33304#true} is VALID [2022-04-28 04:16:38,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {33304#true} call ULTIMATE.init(); {33310#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:38,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {33310#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {33304#true} is VALID [2022-04-28 04:16:38,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {33304#true} assume true; {33304#true} is VALID [2022-04-28 04:16:38,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33304#true} {33304#true} #68#return; {33304#true} is VALID [2022-04-28 04:16:38,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {33304#true} call #t~ret8 := main(); {33304#true} is VALID [2022-04-28 04:16:38,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {33304#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {33309#(= main_~a~0 0)} is VALID [2022-04-28 04:16:38,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {33309#(= main_~a~0 0)} [180] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_274| |v_main_#t~pre4_273|)) (.cse1 (= v_main_~c~0_2186 v_main_~c~0_2176)) (.cse2 (= |v_main_#t~pre6_1602| |v_main_#t~pre6_1594|)) (.cse3 (= v_main_~a~0_334 v_main_~a~0_333)) (.cse4 (= |v_main_#t~pre7_4564| |v_main_#t~pre7_4520|)) (.cse5 (= v_main_~d~0_6802 v_main_~d~0_6750))) (or (and .cse0 (= v_main_~b~0_651 v_main_~b~0_648) .cse1 .cse2 (= |v_main_#t~pre5_480| |v_main_#t~pre5_478|) .cse3 .cse4 .cse5) (and .cse0 (= v_main_~b~0_648 v_main_~b~0_651) .cse1 .cse2 (= |v_main_#t~pre5_478| |v_main_#t~pre5_480|) .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4564|, main_~c~0=v_main_~c~0_2186, main_~d~0=v_main_~d~0_6802, main_~b~0=v_main_~b~0_651, main_#t~pre4=|v_main_#t~pre4_274|, main_#t~pre5=|v_main_#t~pre5_480|, main_~a~0=v_main_~a~0_334, main_#t~pre6=|v_main_#t~pre6_1602|} OutVars{main_#t~pre7=|v_main_#t~pre7_4520|, main_~c~0=v_main_~c~0_2176, main_~d~0=v_main_~d~0_6750, main_~b~0=v_main_~b~0_648, main_#t~pre4=|v_main_#t~pre4_273|, main_#t~pre5=|v_main_#t~pre5_478|, main_~a~0=v_main_~a~0_333, main_#t~pre6=|v_main_#t~pre6_1594|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {33309#(= main_~a~0 0)} is VALID [2022-04-28 04:16:38,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {33309#(= main_~a~0 0)} [179] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {33305#false} is VALID [2022-04-28 04:16:38,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {33305#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {33305#false} is VALID [2022-04-28 04:16:38,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {33305#false} assume !false; {33305#false} is VALID [2022-04-28 04:16:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:16:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:38,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548775460] [2022-04-28 04:16:38,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548775460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:38,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:38,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:41,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:41,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118295027] [2022-04-28 04:16:41,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118295027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:41,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:41,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 04:16:41,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779068648] [2022-04-28 04:16:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:41,082 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 130 [2022-04-28 04:16:41,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:41,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:41,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:41,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 04:16:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 04:16:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3433, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 04:16:41,171 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:50,386 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2022-04-28 04:16:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 04:16:50,386 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 130 [2022-04-28 04:16:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 162 transitions. [2022-04-28 04:16:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 162 transitions. [2022-04-28 04:16:50,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 162 transitions. [2022-04-28 04:16:50,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:50,509 INFO L225 Difference]: With dead ends: 152 [2022-04-28 04:16:50,509 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 04:16:50,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 38 SyntacticMatches, 34 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3632 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=675, Invalid=13367, Unknown=0, NotChecked=0, Total=14042 [2022-04-28 04:16:50,510 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 145 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 6244 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 6368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 6244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:50,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 262 Invalid, 6368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 6244 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 04:16:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 04:16:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2022-04-28 04:16:50,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:50,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:50,588 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:50,588 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:50,589 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-28 04:16:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2022-04-28 04:16:50,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:50,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:50,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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 141 states. [2022-04-28 04:16:50,589 INFO L87 Difference]: Start difference. First operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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 141 states. [2022-04-28 04:16:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:50,590 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-28 04:16:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2022-04-28 04:16:50,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:50,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:50,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:50,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-28 04:16:50,592 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 130 [2022-04-28 04:16:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:50,592 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-28 04:16:50,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:16:50,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 136 transitions. [2022-04-28 04:16:50,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-28 04:16:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 04:16:50,940 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:50,940 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:50,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-04-28 04:16:50,940 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1113581976, now seen corresponding path program 53 times [2022-04-28 04:16:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:50,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801612176] [2022-04-28 04:16:51,870 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:55,956 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:56,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:56,124 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:56,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:00,337 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:00,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:00,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:00,733 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:00,733 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1743249795, now seen corresponding path program 1 times [2022-04-28 04:17:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:00,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003980422] [2022-04-28 04:17:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:00,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {34344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34338#true} is VALID [2022-04-28 04:17:00,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {34338#true} assume true; {34338#true} is VALID [2022-04-28 04:17:00,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34338#true} {34338#true} #68#return; {34338#true} is VALID [2022-04-28 04:17:00,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {34338#true} call ULTIMATE.init(); {34344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:00,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {34344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34338#true} is VALID [2022-04-28 04:17:00,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {34338#true} assume true; {34338#true} is VALID [2022-04-28 04:17:00,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34338#true} {34338#true} #68#return; {34338#true} is VALID [2022-04-28 04:17:00,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {34338#true} call #t~ret8 := main(); {34338#true} is VALID [2022-04-28 04:17:00,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {34338#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {34343#(= main_~a~0 0)} is VALID [2022-04-28 04:17:00,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {34343#(= main_~a~0 0)} [182] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_679 v_main_~b~0_676)) (.cse1 (= v_main_~a~0_340 v_main_~a~0_339)) (.cse2 (= |v_main_#t~pre4_279| |v_main_#t~pre4_278|)) (.cse3 (= |v_main_#t~pre5_501| |v_main_#t~pre5_499|))) (or (and .cse0 (= v_main_~c~0_2244 v_main_~c~0_2254) (= |v_main_#t~pre7_4656| |v_main_#t~pre7_4701|) (= |v_main_#t~pre6_1640| |v_main_#t~pre6_1648|) .cse1 .cse2 (= v_main_~d~0_6965 v_main_~d~0_7018) .cse3) (and .cse0 (= |v_main_#t~pre6_1648| |v_main_#t~pre6_1640|) .cse1 .cse2 (= |v_main_#t~pre7_4701| |v_main_#t~pre7_4656|) .cse3 (= v_main_~c~0_2254 v_main_~c~0_2244) (= v_main_~d~0_7018 v_main_~d~0_6965)))) InVars {main_#t~pre7=|v_main_#t~pre7_4701|, main_~c~0=v_main_~c~0_2254, main_~d~0=v_main_~d~0_7018, main_~b~0=v_main_~b~0_679, main_#t~pre4=|v_main_#t~pre4_279|, main_#t~pre5=|v_main_#t~pre5_501|, main_~a~0=v_main_~a~0_340, main_#t~pre6=|v_main_#t~pre6_1648|} OutVars{main_#t~pre7=|v_main_#t~pre7_4656|, main_~c~0=v_main_~c~0_2244, main_~d~0=v_main_~d~0_6965, main_~b~0=v_main_~b~0_676, main_#t~pre4=|v_main_#t~pre4_278|, main_#t~pre5=|v_main_#t~pre5_499|, main_~a~0=v_main_~a~0_339, main_#t~pre6=|v_main_#t~pre6_1640|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {34343#(= main_~a~0 0)} is VALID [2022-04-28 04:17:00,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {34343#(= main_~a~0 0)} [181] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {34339#false} is VALID [2022-04-28 04:17:00,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {34339#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {34339#false} is VALID [2022-04-28 04:17:00,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {34339#false} assume !false; {34339#false} is VALID [2022-04-28 04:17:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:17:00,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:00,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003980422] [2022-04-28 04:17:00,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003980422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:00,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:00,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:02,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:02,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801612176] [2022-04-28 04:17:02,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801612176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:02,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:02,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 04:17:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48154401] [2022-04-28 04:17:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 132 [2022-04-28 04:17:02,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:02,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:02,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:02,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 04:17:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 04:17:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3552, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 04:17:02,787 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:10,627 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2022-04-28 04:17:10,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 04:17:10,628 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 132 [2022-04-28 04:17:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 164 transitions. [2022-04-28 04:17:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 164 transitions. [2022-04-28 04:17:10,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 164 transitions. [2022-04-28 04:17:10,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:10,751 INFO L225 Difference]: With dead ends: 154 [2022-04-28 04:17:10,752 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 04:17:10,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=684, Invalid=13836, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 04:17:10,753 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 155 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5206 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 5206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:10,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 82 Invalid, 5338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 5206 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 04:17:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 04:17:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2022-04-28 04:17:10,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:10,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:10,836 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:10,836 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:10,838 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2022-04-28 04:17:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2022-04-28 04:17:10,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:10,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:10,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 143 states. [2022-04-28 04:17:10,838 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 143 states. [2022-04-28 04:17:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:10,839 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2022-04-28 04:17:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2022-04-28 04:17:10,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:10,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:10,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:10,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2022-04-28 04:17:10,841 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 132 [2022-04-28 04:17:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:10,841 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2022-04-28 04:17:10,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:10,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 138 transitions. [2022-04-28 04:17:11,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-04-28 04:17:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 04:17:11,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:11,194 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:17:11,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-04-28 04:17:11,194 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:11,194 INFO L85 PathProgramCache]: Analyzing trace with hash -771599802, now seen corresponding path program 54 times [2022-04-28 04:17:11,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:11,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705007669] [2022-04-28 04:17:12,279 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:16,356 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:16,399 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:16,515 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:16,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:20,714 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:20,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:20,875 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:21,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:21,130 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1743311299, now seen corresponding path program 1 times [2022-04-28 04:17:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:21,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74429903] [2022-04-28 04:17:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:21,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {35393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {35387#true} is VALID [2022-04-28 04:17:21,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {35387#true} assume true; {35387#true} is VALID [2022-04-28 04:17:21,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35387#true} {35387#true} #68#return; {35387#true} is VALID [2022-04-28 04:17:21,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {35387#true} call ULTIMATE.init(); {35393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:21,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {35393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {35387#true} is VALID [2022-04-28 04:17:21,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {35387#true} assume true; {35387#true} is VALID [2022-04-28 04:17:21,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35387#true} {35387#true} #68#return; {35387#true} is VALID [2022-04-28 04:17:21,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {35387#true} call #t~ret8 := main(); {35387#true} is VALID [2022-04-28 04:17:21,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {35387#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {35392#(= main_~a~0 0)} is VALID [2022-04-28 04:17:21,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {35392#(= main_~a~0 0)} [184] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_346 v_main_~a~0_345)) (.cse1 (= |v_main_#t~pre7_4841| |v_main_#t~pre7_4795|)) (.cse2 (= |v_main_#t~pre5_522| |v_main_#t~pre5_520|)) (.cse3 (= v_main_~d~0_7238 v_main_~d~0_7184)) (.cse4 (= v_main_~c~0_2322 v_main_~c~0_2312))) (or (and .cse0 .cse1 .cse2 (= v_main_~b~0_704 v_main_~b~0_707) (= |v_main_#t~pre6_1686| |v_main_#t~pre6_1694|) (= |v_main_#t~pre4_283| |v_main_#t~pre4_284|) .cse3 .cse4) (and .cse0 .cse1 (= |v_main_#t~pre4_284| |v_main_#t~pre4_283|) .cse2 (= |v_main_#t~pre6_1694| |v_main_#t~pre6_1686|) (= v_main_~b~0_707 v_main_~b~0_704) .cse3 .cse4))) InVars {main_#t~pre7=|v_main_#t~pre7_4841|, main_~c~0=v_main_~c~0_2322, main_~d~0=v_main_~d~0_7238, main_~b~0=v_main_~b~0_707, main_#t~pre4=|v_main_#t~pre4_284|, main_#t~pre5=|v_main_#t~pre5_522|, main_~a~0=v_main_~a~0_346, main_#t~pre6=|v_main_#t~pre6_1694|} OutVars{main_#t~pre7=|v_main_#t~pre7_4795|, main_~c~0=v_main_~c~0_2312, main_~d~0=v_main_~d~0_7184, main_~b~0=v_main_~b~0_704, main_#t~pre4=|v_main_#t~pre4_283|, main_#t~pre5=|v_main_#t~pre5_520|, main_~a~0=v_main_~a~0_345, main_#t~pre6=|v_main_#t~pre6_1686|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {35392#(= main_~a~0 0)} is VALID [2022-04-28 04:17:21,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {35392#(= main_~a~0 0)} [183] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {35388#false} is VALID [2022-04-28 04:17:21,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {35388#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {35388#false} is VALID [2022-04-28 04:17:21,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {35388#false} assume !false; {35388#false} is VALID [2022-04-28 04:17:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:17:21,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:21,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74429903] [2022-04-28 04:17:21,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74429903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:21,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:21,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:23,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:23,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705007669] [2022-04-28 04:17:23,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705007669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:23,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:23,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 04:17:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866705271] [2022-04-28 04:17:23,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 134 [2022-04-28 04:17:23,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:23,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:23,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:23,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 04:17:23,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:23,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 04:17:23,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3673, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 04:17:23,569 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:32,023 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-04-28 04:17:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 04:17:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 134 [2022-04-28 04:17:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 166 transitions. [2022-04-28 04:17:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 166 transitions. [2022-04-28 04:17:32,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 166 transitions. [2022-04-28 04:17:32,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:32,153 INFO L225 Difference]: With dead ends: 156 [2022-04-28 04:17:32,154 INFO L226 Difference]: Without dead ends: 145 [2022-04-28 04:17:32,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 45 SyntacticMatches, 29 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3902 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=693, Invalid=14313, Unknown=0, NotChecked=0, Total=15006 [2022-04-28 04:17:32,155 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 203 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5654 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 5654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:32,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 27 Invalid, 5835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 5654 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 04:17:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-28 04:17:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2022-04-28 04:17:32,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:32,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:32,271 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:32,272 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:32,273 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2022-04-28 04:17:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2022-04-28 04:17:32,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:32,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:32,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 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 145 states. [2022-04-28 04:17:32,274 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 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 145 states. [2022-04-28 04:17:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:32,276 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2022-04-28 04:17:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2022-04-28 04:17:32,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:32,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:32,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:32,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2022-04-28 04:17:32,278 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 134 [2022-04-28 04:17:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:32,278 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2022-04-28 04:17:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:32,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 140 transitions. [2022-04-28 04:17:32,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-04-28 04:17:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 04:17:32,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:32,706 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:17:32,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-04-28 04:17:32,707 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:32,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1455754916, now seen corresponding path program 55 times [2022-04-28 04:17:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:32,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [974754556] [2022-04-28 04:17:33,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:37,744 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:37,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:37,924 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:38,046 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:42,135 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:42,185 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:42,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:42,555 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:42,555 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1743372803, now seen corresponding path program 1 times [2022-04-28 04:17:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:42,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938723466] [2022-04-28 04:17:42,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:42,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {36457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {36451#true} is VALID [2022-04-28 04:17:42,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {36451#true} assume true; {36451#true} is VALID [2022-04-28 04:17:42,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36451#true} {36451#true} #68#return; {36451#true} is VALID [2022-04-28 04:17:42,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {36451#true} call ULTIMATE.init(); {36457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:42,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {36457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {36451#true} is VALID [2022-04-28 04:17:42,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {36451#true} assume true; {36451#true} is VALID [2022-04-28 04:17:42,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36451#true} {36451#true} #68#return; {36451#true} is VALID [2022-04-28 04:17:42,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {36451#true} call #t~ret8 := main(); {36451#true} is VALID [2022-04-28 04:17:42,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {36451#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {36456#(= main_~a~0 0)} is VALID [2022-04-28 04:17:42,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {36456#(= main_~a~0 0)} [186] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_735 v_main_~b~0_732)) (.cse1 (= |v_main_#t~pre5_543| |v_main_#t~pre5_541|)) (.cse2 (= |v_main_#t~pre7_4984| |v_main_#t~pre7_4937|)) (.cse3 (= |v_main_#t~pre4_289| |v_main_#t~pre4_288|)) (.cse4 (= v_main_~a~0_352 v_main_~a~0_351)) (.cse5 (= v_main_~d~0_7462 v_main_~d~0_7407))) (or (and (= |v_main_#t~pre6_1740| |v_main_#t~pre6_1732|) .cse0 (= v_main_~c~0_2390 v_main_~c~0_2380) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= |v_main_#t~pre6_1732| |v_main_#t~pre6_1740|) .cse0 (= v_main_~c~0_2380 v_main_~c~0_2390) .cse1 .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4984|, main_~c~0=v_main_~c~0_2390, main_~d~0=v_main_~d~0_7462, main_~b~0=v_main_~b~0_735, main_#t~pre4=|v_main_#t~pre4_289|, main_#t~pre5=|v_main_#t~pre5_543|, main_~a~0=v_main_~a~0_352, main_#t~pre6=|v_main_#t~pre6_1740|} OutVars{main_#t~pre7=|v_main_#t~pre7_4937|, main_~c~0=v_main_~c~0_2380, main_~d~0=v_main_~d~0_7407, main_~b~0=v_main_~b~0_732, main_#t~pre4=|v_main_#t~pre4_288|, main_#t~pre5=|v_main_#t~pre5_541|, main_~a~0=v_main_~a~0_351, main_#t~pre6=|v_main_#t~pre6_1732|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {36456#(= main_~a~0 0)} is VALID [2022-04-28 04:17:42,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {36456#(= main_~a~0 0)} [185] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {36452#false} is VALID [2022-04-28 04:17:42,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {36452#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {36452#false} is VALID [2022-04-28 04:17:42,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {36452#false} assume !false; {36452#false} is VALID [2022-04-28 04:17:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:17:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:42,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938723466] [2022-04-28 04:17:42,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938723466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:42,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:42,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:44,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:44,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [974754556] [2022-04-28 04:17:44,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [974754556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:44,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:44,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 04:17:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295422042] [2022-04-28 04:17:44,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 136 [2022-04-28 04:17:44,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:44,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:44,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:44,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 04:17:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:44,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 04:17:44,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3796, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 04:17:44,917 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:54,653 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2022-04-28 04:17:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 04:17:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 136 [2022-04-28 04:17:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 171 transitions. [2022-04-28 04:17:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 171 transitions. [2022-04-28 04:17:54,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 171 transitions. [2022-04-28 04:17:54,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:54,783 INFO L225 Difference]: With dead ends: 160 [2022-04-28 04:17:54,783 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 04:17:54,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3924 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=702, Invalid=14798, Unknown=0, NotChecked=0, Total=15500 [2022-04-28 04:17:54,784 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 208 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6701 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 6701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:54,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 137 Invalid, 6888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 6701 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 04:17:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 04:17:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2022-04-28 04:17:54,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:54,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:54,870 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:54,871 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:54,872 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2022-04-28 04:17:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2022-04-28 04:17:54,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:54,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:54,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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 149 states. [2022-04-28 04:17:54,873 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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 149 states. [2022-04-28 04:17:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:54,875 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2022-04-28 04:17:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2022-04-28 04:17:54,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:54,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:54,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:54,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2022-04-28 04:17:54,877 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 136 [2022-04-28 04:17:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:54,877 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2022-04-28 04:17:54,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:54,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 144 transitions. [2022-04-28 04:17:55,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-28 04:17:55,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 04:17:55,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:55,258 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:17:55,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-04-28 04:17:55,258 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:55,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1245041790, now seen corresponding path program 56 times [2022-04-28 04:17:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:55,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1358711017] [2022-04-28 04:17:56,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:56,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:56,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:56,521 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:56,640 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:56,754 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:57,030 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:57,031 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1743434307, now seen corresponding path program 1 times [2022-04-28 04:17:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:57,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77683434] [2022-04-28 04:17:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:57,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:57,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:57,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {37548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {37542#true} is VALID [2022-04-28 04:17:57,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-28 04:17:57,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37542#true} {37542#true} #68#return; {37542#true} is VALID [2022-04-28 04:17:57,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {37542#true} call ULTIMATE.init(); {37548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:57,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {37548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {37542#true} is VALID [2022-04-28 04:17:57,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-28 04:17:57,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37542#true} {37542#true} #68#return; {37542#true} is VALID [2022-04-28 04:17:57,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {37542#true} call #t~ret8 := main(); {37542#true} is VALID [2022-04-28 04:17:57,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {37542#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {37547#(= main_~a~0 0)} is VALID [2022-04-28 04:17:57,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {37547#(= main_~a~0 0)} [188] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_5124| |v_main_#t~pre7_5076|)) (.cse1 (= v_main_~b~0_763 v_main_~b~0_760)) (.cse2 (= |v_main_#t~pre5_564| |v_main_#t~pre5_562|)) (.cse3 (= |v_main_#t~pre4_294| |v_main_#t~pre4_293|)) (.cse4 (= v_main_~d~0_7683 v_main_~d~0_7627)) (.cse5 (= v_main_~a~0_358 v_main_~a~0_357))) (or (and (= |v_main_#t~pre6_1777| |v_main_#t~pre6_1785|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~c~0_2446 v_main_~c~0_2456)) (and .cse0 .cse1 (= |v_main_#t~pre6_1785| |v_main_#t~pre6_1777|) (= v_main_~c~0_2456 v_main_~c~0_2446) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_5124|, main_~c~0=v_main_~c~0_2456, main_~d~0=v_main_~d~0_7683, main_~b~0=v_main_~b~0_763, main_#t~pre4=|v_main_#t~pre4_294|, main_#t~pre5=|v_main_#t~pre5_564|, main_~a~0=v_main_~a~0_358, main_#t~pre6=|v_main_#t~pre6_1785|} OutVars{main_#t~pre7=|v_main_#t~pre7_5076|, main_~c~0=v_main_~c~0_2446, main_~d~0=v_main_~d~0_7627, main_~b~0=v_main_~b~0_760, main_#t~pre4=|v_main_#t~pre4_293|, main_#t~pre5=|v_main_#t~pre5_562|, main_~a~0=v_main_~a~0_357, main_#t~pre6=|v_main_#t~pre6_1777|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {37547#(= main_~a~0 0)} is VALID [2022-04-28 04:17:57,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {37547#(= main_~a~0 0)} [187] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {37543#false} is VALID [2022-04-28 04:17:57,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {37543#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {37543#false} is VALID [2022-04-28 04:17:57,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {37543#false} assume !false; {37543#false} is VALID [2022-04-28 04:17:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:17:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:57,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77683434] [2022-04-28 04:17:57,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77683434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:57,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:57,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:59,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:59,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1358711017] [2022-04-28 04:17:59,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1358711017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:59,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:59,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-28 04:17:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181990492] [2022-04-28 04:17:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 138 [2022-04-28 04:17:59,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:59,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:17:59,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:59,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-28 04:17:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-28 04:17:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3921, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 04:17:59,584 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:09,762 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-04-28 04:18:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 04:18:09,762 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 138 [2022-04-28 04:18:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 171 transitions. [2022-04-28 04:18:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 171 transitions. [2022-04-28 04:18:09,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 171 transitions. [2022-04-28 04:18:09,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:09,889 INFO L225 Difference]: With dead ends: 161 [2022-04-28 04:18:09,889 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 04:18:09,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 43 SyntacticMatches, 33 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4292 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=711, Invalid=15291, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 04:18:09,890 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 190 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 7085 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 7085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:09,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 92 Invalid, 7260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 7085 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 04:18:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 04:18:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2022-04-28 04:18:09,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:09,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:09,994 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:09,995 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:09,996 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2022-04-28 04:18:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2022-04-28 04:18:09,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:09,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:09,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 states have internal predecessors, (143), 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 150 states. [2022-04-28 04:18:09,997 INFO L87 Difference]: Start difference. First operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 states have internal predecessors, (143), 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 150 states. [2022-04-28 04:18:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:09,999 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2022-04-28 04:18:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2022-04-28 04:18:09,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:09,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:09,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:09,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2022-04-28 04:18:10,001 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 138 [2022-04-28 04:18:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:10,001 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2022-04-28 04:18:10,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:10,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 146 transitions. [2022-04-28 04:18:10,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2022-04-28 04:18:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-28 04:18:10,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:10,397 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:10,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-04-28 04:18:10,397 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:10,397 INFO L85 PathProgramCache]: Analyzing trace with hash 167077131, now seen corresponding path program 57 times [2022-04-28 04:18:10,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:10,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1891544405] [2022-04-28 04:18:11,315 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:13,930 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:13,972 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:14,090 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:14,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:18,311 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:18,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:18,473 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:18,745 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:18,745 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1743495811, now seen corresponding path program 1 times [2022-04-28 04:18:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:18,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824348342] [2022-04-28 04:18:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:18,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {38650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {38644#true} is VALID [2022-04-28 04:18:18,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {38644#true} assume true; {38644#true} is VALID [2022-04-28 04:18:18,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38644#true} {38644#true} #68#return; {38644#true} is VALID [2022-04-28 04:18:18,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {38644#true} call ULTIMATE.init(); {38650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:18,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {38650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {38644#true} is VALID [2022-04-28 04:18:18,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {38644#true} assume true; {38644#true} is VALID [2022-04-28 04:18:18,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38644#true} {38644#true} #68#return; {38644#true} is VALID [2022-04-28 04:18:18,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {38644#true} call #t~ret8 := main(); {38644#true} is VALID [2022-04-28 04:18:18,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {38644#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {38649#(= main_~a~0 0)} is VALID [2022-04-28 04:18:18,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {38649#(= main_~a~0 0)} [190] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_7908 v_main_~d~0_7851)) (.cse1 (= |v_main_#t~pre4_299| |v_main_#t~pre4_298|)) (.cse2 (= v_main_~c~0_2527 v_main_~c~0_2516)) (.cse3 (= v_main_~a~0_364 v_main_~a~0_363)) (.cse4 (= |v_main_#t~pre6_1833| |v_main_#t~pre6_1824|)) (.cse5 (= |v_main_#t~pre7_5264| |v_main_#t~pre7_5216|)) (.cse6 (= |v_main_#t~pre5_585| |v_main_#t~pre5_583|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_791 v_main_~b~0_788) .cse4 .cse5 .cse6) (and .cse0 .cse1 (= v_main_~b~0_788 v_main_~b~0_791) .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_5264|, main_~c~0=v_main_~c~0_2527, main_~d~0=v_main_~d~0_7908, main_~b~0=v_main_~b~0_791, main_#t~pre4=|v_main_#t~pre4_299|, main_#t~pre5=|v_main_#t~pre5_585|, main_~a~0=v_main_~a~0_364, main_#t~pre6=|v_main_#t~pre6_1833|} OutVars{main_#t~pre7=|v_main_#t~pre7_5216|, main_~c~0=v_main_~c~0_2516, main_~d~0=v_main_~d~0_7851, main_~b~0=v_main_~b~0_788, main_#t~pre4=|v_main_#t~pre4_298|, main_#t~pre5=|v_main_#t~pre5_583|, main_~a~0=v_main_~a~0_363, main_#t~pre6=|v_main_#t~pre6_1824|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {38649#(= main_~a~0 0)} is VALID [2022-04-28 04:18:18,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {38649#(= main_~a~0 0)} [189] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {38645#false} is VALID [2022-04-28 04:18:18,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {38645#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {38645#false} is VALID [2022-04-28 04:18:18,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {38645#false} assume !false; {38645#false} is VALID [2022-04-28 04:18:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:18:18,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:18,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824348342] [2022-04-28 04:18:18,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824348342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:18,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:18,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:21,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:21,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1891544405] [2022-04-28 04:18:21,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1891544405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:21,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:21,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 04:18:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339572417] [2022-04-28 04:18:21,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:21,170 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 141 [2022-04-28 04:18:21,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:21,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:21,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:21,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 04:18:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:21,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 04:18:21,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=4048, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 04:18:21,266 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:31,612 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2022-04-28 04:18:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 04:18:31,612 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 141 [2022-04-28 04:18:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 173 transitions. [2022-04-28 04:18:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 173 transitions. [2022-04-28 04:18:31,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 173 transitions. [2022-04-28 04:18:31,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:31,742 INFO L225 Difference]: With dead ends: 163 [2022-04-28 04:18:31,742 INFO L226 Difference]: Without dead ends: 152 [2022-04-28 04:18:31,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 49 SyntacticMatches, 29 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4251 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=720, Invalid=15792, Unknown=0, NotChecked=0, Total=16512 [2022-04-28 04:18:31,744 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 163 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7092 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 7092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:31,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 172 Invalid, 7234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 7092 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 04:18:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-28 04:18:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2022-04-28 04:18:31,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:31,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:31,834 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:31,834 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:31,836 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2022-04-28 04:18:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2022-04-28 04:18:31,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:31,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:31,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 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 152 states. [2022-04-28 04:18:31,836 INFO L87 Difference]: Start difference. First operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 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 152 states. [2022-04-28 04:18:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:31,838 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2022-04-28 04:18:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2022-04-28 04:18:31,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:31,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:31,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:31,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2022-04-28 04:18:31,840 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 141 [2022-04-28 04:18:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:31,841 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2022-04-28 04:18:31,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:31,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 147 transitions. [2022-04-28 04:18:32,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2022-04-28 04:18:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 04:18:32,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:32,238 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:32,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-04-28 04:18:32,239 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:32,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1581155369, now seen corresponding path program 58 times [2022-04-28 04:18:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:32,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [82274081] [2022-04-28 04:18:33,144 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:33,261 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:33,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:33,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:33,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:33,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:33,975 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:33,975 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1743557315, now seen corresponding path program 1 times [2022-04-28 04:18:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:33,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478618758] [2022-04-28 04:18:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:34,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:34,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {39765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {39759#true} is VALID [2022-04-28 04:18:34,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {39759#true} assume true; {39759#true} is VALID [2022-04-28 04:18:34,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39759#true} {39759#true} #68#return; {39759#true} is VALID [2022-04-28 04:18:34,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {39759#true} call ULTIMATE.init(); {39765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:34,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {39765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {39759#true} is VALID [2022-04-28 04:18:34,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {39759#true} assume true; {39759#true} is VALID [2022-04-28 04:18:34,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39759#true} {39759#true} #68#return; {39759#true} is VALID [2022-04-28 04:18:34,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {39759#true} call #t~ret8 := main(); {39759#true} is VALID [2022-04-28 04:18:34,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {39759#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {39764#(= main_~a~0 0)} is VALID [2022-04-28 04:18:34,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {39764#(= main_~a~0 0)} [192] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_304| |v_main_#t~pre4_303|)) (.cse1 (= |v_main_#t~pre7_5407| |v_main_#t~pre7_5358|)) (.cse2 (= |v_main_#t~pre5_606| |v_main_#t~pre5_604|)) (.cse3 (= v_main_~d~0_8137 v_main_~d~0_8079)) (.cse4 (= v_main_~b~0_819 v_main_~b~0_816)) (.cse5 (= |v_main_#t~pre6_1881| |v_main_#t~pre6_1872|))) (or (and (= v_main_~c~0_2598 v_main_~c~0_2587) .cse0 .cse1 (= v_main_~a~0_370 v_main_~a~0_369) .cse2 .cse3 .cse4 .cse5) (and (= v_main_~c~0_2587 v_main_~c~0_2598) .cse0 (= v_main_~a~0_369 v_main_~a~0_370) .cse1 .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_5407|, main_~c~0=v_main_~c~0_2598, main_~d~0=v_main_~d~0_8137, main_~b~0=v_main_~b~0_819, main_#t~pre4=|v_main_#t~pre4_304|, main_#t~pre5=|v_main_#t~pre5_606|, main_~a~0=v_main_~a~0_370, main_#t~pre6=|v_main_#t~pre6_1881|} OutVars{main_#t~pre7=|v_main_#t~pre7_5358|, main_~c~0=v_main_~c~0_2587, main_~d~0=v_main_~d~0_8079, main_~b~0=v_main_~b~0_816, main_#t~pre4=|v_main_#t~pre4_303|, main_#t~pre5=|v_main_#t~pre5_604|, main_~a~0=v_main_~a~0_369, main_#t~pre6=|v_main_#t~pre6_1872|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {39764#(= main_~a~0 0)} is VALID [2022-04-28 04:18:34,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {39764#(= main_~a~0 0)} [191] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {39760#false} is VALID [2022-04-28 04:18:34,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {39760#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {39760#false} is VALID [2022-04-28 04:18:34,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {39760#false} assume !false; {39760#false} is VALID [2022-04-28 04:18:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:18:34,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:34,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478618758] [2022-04-28 04:18:34,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478618758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:34,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:34,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:36,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:36,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [82274081] [2022-04-28 04:18:36,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [82274081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:36,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:36,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 04:18:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968894229] [2022-04-28 04:18:36,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 143 [2022-04-28 04:18:36,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:36,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:36,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:36,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 04:18:36,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 04:18:36,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=4177, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 04:18:36,481 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:46,222 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2022-04-28 04:18:46,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 04:18:46,222 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 143 [2022-04-28 04:18:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 175 transitions. [2022-04-28 04:18:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 175 transitions. [2022-04-28 04:18:46,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 175 transitions. [2022-04-28 04:18:46,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:46,355 INFO L225 Difference]: With dead ends: 165 [2022-04-28 04:18:46,355 INFO L226 Difference]: Without dead ends: 154 [2022-04-28 04:18:46,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 54 SyntacticMatches, 25 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4431 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=729, Invalid=16301, Unknown=0, NotChecked=0, Total=17030 [2022-04-28 04:18:46,356 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 165 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6722 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 6866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 6722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:46,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 82 Invalid, 6866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 6722 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 04:18:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-28 04:18:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2022-04-28 04:18:46,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:46,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:46,444 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:46,444 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:46,445 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2022-04-28 04:18:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2022-04-28 04:18:46,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:46,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:46,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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 154 states. [2022-04-28 04:18:46,446 INFO L87 Difference]: Start difference. First operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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 154 states. [2022-04-28 04:18:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:46,447 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2022-04-28 04:18:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2022-04-28 04:18:46,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:46,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:46,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:46,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2022-04-28 04:18:46,448 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 143 [2022-04-28 04:18:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:46,449 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2022-04-28 04:18:46,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:46,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 149 transitions. [2022-04-28 04:18:46,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2022-04-28 04:18:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 04:18:46,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:46,848 INFO L195 NwaCegarLoop]: trace histogram [50, 50, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:46,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-04-28 04:18:46,849 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash -994290745, now seen corresponding path program 59 times [2022-04-28 04:18:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:46,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953333473] [2022-04-28 04:18:47,788 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:51,865 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:51,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:52,024 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:52,147 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:56,223 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:56,265 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:56,381 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:56,657 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:56,657 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1743618819, now seen corresponding path program 1 times [2022-04-28 04:18:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:56,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875773414] [2022-04-28 04:18:56,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:56,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:56,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {40895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {40889#true} is VALID [2022-04-28 04:18:56,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {40889#true} assume true; {40889#true} is VALID [2022-04-28 04:18:56,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40889#true} {40889#true} #68#return; {40889#true} is VALID [2022-04-28 04:18:56,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {40889#true} call ULTIMATE.init(); {40895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:56,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {40895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {40889#true} is VALID [2022-04-28 04:18:56,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {40889#true} assume true; {40889#true} is VALID [2022-04-28 04:18:56,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40889#true} {40889#true} #68#return; {40889#true} is VALID [2022-04-28 04:18:56,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {40889#true} call #t~ret8 := main(); {40889#true} is VALID [2022-04-28 04:18:56,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {40889#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {40894#(= main_~a~0 0)} is VALID [2022-04-28 04:18:56,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {40894#(= main_~a~0 0)} [194] L22-3-->L22-4_primed: Formula: (and (= v_main_~a~0_376 v_main_~a~0_375) (= |v_main_#t~pre6_1929| |v_main_#t~pre6_1920|) (= v_main_~d~0_8370 v_main_~d~0_8311) (= v_main_~c~0_2669 v_main_~c~0_2658) (= |v_main_#t~pre5_627| |v_main_#t~pre5_625|) (= |v_main_#t~pre7_5553| |v_main_#t~pre7_5503|) (= v_main_~b~0_847 v_main_~b~0_844) (= |v_main_#t~pre4_309| |v_main_#t~pre4_308|)) InVars {main_#t~pre7=|v_main_#t~pre7_5553|, main_~c~0=v_main_~c~0_2669, main_~d~0=v_main_~d~0_8370, main_~b~0=v_main_~b~0_847, main_#t~pre4=|v_main_#t~pre4_309|, main_#t~pre5=|v_main_#t~pre5_627|, main_~a~0=v_main_~a~0_376, main_#t~pre6=|v_main_#t~pre6_1929|} OutVars{main_#t~pre7=|v_main_#t~pre7_5503|, main_~c~0=v_main_~c~0_2658, main_~d~0=v_main_~d~0_8311, main_~b~0=v_main_~b~0_844, main_#t~pre4=|v_main_#t~pre4_308|, main_#t~pre5=|v_main_#t~pre5_625|, main_~a~0=v_main_~a~0_375, main_#t~pre6=|v_main_#t~pre6_1920|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {40894#(= main_~a~0 0)} is VALID [2022-04-28 04:18:56,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {40894#(= main_~a~0 0)} [193] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {40890#false} is VALID [2022-04-28 04:18:56,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {40890#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {40890#false} is VALID [2022-04-28 04:18:56,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {40890#false} assume !false; {40890#false} is VALID [2022-04-28 04:18:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:18:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875773414] [2022-04-28 04:18:56,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875773414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:56,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:56,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:59,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:59,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1953333473] [2022-04-28 04:18:59,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1953333473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:59,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:59,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-28 04:18:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647273966] [2022-04-28 04:18:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:59,203 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 145 [2022-04-28 04:18:59,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:59,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:18:59,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:59,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-28 04:18:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:59,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-28 04:18:59,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4308, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 04:18:59,299 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:10,171 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-04-28 04:19:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-28 04:19:10,171 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 145 [2022-04-28 04:19:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 177 transitions. [2022-04-28 04:19:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 177 transitions. [2022-04-28 04:19:10,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 177 transitions. [2022-04-28 04:19:10,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:10,311 INFO L225 Difference]: With dead ends: 167 [2022-04-28 04:19:10,311 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 04:19:10,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 46 SyntacticMatches, 34 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4624 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=738, Invalid=16818, Unknown=0, NotChecked=0, Total=17556 [2022-04-28 04:19:10,312 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 197 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7516 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 7697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 7516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:10,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 97 Invalid, 7697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 7516 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 04:19:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 04:19:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2022-04-28 04:19:10,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:10,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:10,422 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:10,422 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:10,423 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2022-04-28 04:19:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2022-04-28 04:19:10,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:10,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:10,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 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 156 states. [2022-04-28 04:19:10,424 INFO L87 Difference]: Start difference. First operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 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 156 states. [2022-04-28 04:19:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:10,425 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2022-04-28 04:19:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2022-04-28 04:19:10,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:10,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:10,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:10,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2022-04-28 04:19:10,427 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 145 [2022-04-28 04:19:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:10,427 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2022-04-28 04:19:10,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:10,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 151 transitions. [2022-04-28 04:19:10,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2022-04-28 04:19:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 04:19:10,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:10,858 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:10,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-04-28 04:19:10,858 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2096843803, now seen corresponding path program 60 times [2022-04-28 04:19:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:10,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905610117] [2022-04-28 04:19:11,754 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:15,838 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:15,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:16,002 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:16,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:20,204 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:20,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:20,374 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:20,639 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:20,639 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:19:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1743680323, now seen corresponding path program 1 times [2022-04-28 04:19:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:20,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549001204] [2022-04-28 04:19:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:19:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:20,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {42040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {42034#true} is VALID [2022-04-28 04:19:20,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {42034#true} assume true; {42034#true} is VALID [2022-04-28 04:19:20,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42034#true} {42034#true} #68#return; {42034#true} is VALID [2022-04-28 04:19:20,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {42034#true} call ULTIMATE.init(); {42040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:19:20,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {42040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {42034#true} is VALID [2022-04-28 04:19:20,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {42034#true} assume true; {42034#true} is VALID [2022-04-28 04:19:20,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42034#true} {42034#true} #68#return; {42034#true} is VALID [2022-04-28 04:19:20,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {42034#true} call #t~ret8 := main(); {42034#true} is VALID [2022-04-28 04:19:20,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {42034#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {42039#(= main_~a~0 0)} is VALID [2022-04-28 04:19:20,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {42039#(= main_~a~0 0)} [196] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre5_648| |v_main_#t~pre5_646|) (= |v_main_#t~pre7_5702| |v_main_#t~pre7_5651|) (= v_main_~c~0_2740 v_main_~c~0_2729) (= v_main_~d~0_8607 v_main_~d~0_8547) (= v_main_~a~0_382 v_main_~a~0_381) (= |v_main_#t~pre4_314| |v_main_#t~pre4_313|) (= v_main_~b~0_875 v_main_~b~0_872) (= |v_main_#t~pre6_1977| |v_main_#t~pre6_1968|)) InVars {main_#t~pre7=|v_main_#t~pre7_5702|, main_~c~0=v_main_~c~0_2740, main_~d~0=v_main_~d~0_8607, main_~b~0=v_main_~b~0_875, main_#t~pre4=|v_main_#t~pre4_314|, main_#t~pre5=|v_main_#t~pre5_648|, main_~a~0=v_main_~a~0_382, main_#t~pre6=|v_main_#t~pre6_1977|} OutVars{main_#t~pre7=|v_main_#t~pre7_5651|, main_~c~0=v_main_~c~0_2729, main_~d~0=v_main_~d~0_8547, main_~b~0=v_main_~b~0_872, main_#t~pre4=|v_main_#t~pre4_313|, main_#t~pre5=|v_main_#t~pre5_646|, main_~a~0=v_main_~a~0_381, main_#t~pre6=|v_main_#t~pre6_1968|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {42039#(= main_~a~0 0)} is VALID [2022-04-28 04:19:20,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {42039#(= main_~a~0 0)} [195] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {42035#false} is VALID [2022-04-28 04:19:20,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {42035#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {42035#false} is VALID [2022-04-28 04:19:20,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {42035#false} assume !false; {42035#false} is VALID [2022-04-28 04:19:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:19:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549001204] [2022-04-28 04:19:20,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549001204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:20,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:20,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:19:23,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:23,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905610117] [2022-04-28 04:19:23,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905610117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:23,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:23,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-28 04:19:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309047882] [2022-04-28 04:19:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 147 [2022-04-28 04:19:23,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:23,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:23,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:23,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-28 04:19:23,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:23,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-28 04:19:23,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=4441, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 04:19:23,364 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:33,140 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-04-28 04:19:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-28 04:19:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 147 [2022-04-28 04:19:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 179 transitions. [2022-04-28 04:19:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 179 transitions. [2022-04-28 04:19:33,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 179 transitions. [2022-04-28 04:19:33,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:33,278 INFO L225 Difference]: With dead ends: 169 [2022-04-28 04:19:33,278 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 04:19:33,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 47 SyntacticMatches, 34 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4806 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=747, Invalid=17343, Unknown=0, NotChecked=0, Total=18090 [2022-04-28 04:19:33,280 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 169 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6610 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 6758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 6610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:33,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 82 Invalid, 6758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 6610 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 04:19:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 04:19:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2022-04-28 04:19:33,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:33,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:33,388 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:33,388 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:33,390 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2022-04-28 04:19:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2022-04-28 04:19:33,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:33,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:33,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 158 states. [2022-04-28 04:19:33,391 INFO L87 Difference]: Start difference. First operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 158 states. [2022-04-28 04:19:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:33,392 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2022-04-28 04:19:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2022-04-28 04:19:33,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:33,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:33,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:33,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2022-04-28 04:19:33,395 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 147 [2022-04-28 04:19:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:33,395 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2022-04-28 04:19:33,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:33,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 153 transitions. [2022-04-28 04:19:33,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2022-04-28 04:19:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 04:19:33,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:33,822 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:33,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-04-28 04:19:33,822 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:33,823 INFO L85 PathProgramCache]: Analyzing trace with hash -793410429, now seen corresponding path program 61 times [2022-04-28 04:19:33,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:33,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [35177612] [2022-04-28 04:19:34,728 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:34,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:34,958 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:35,079 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:35,185 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:35,302 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:35,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:35,576 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:19:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1743741827, now seen corresponding path program 1 times [2022-04-28 04:19:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:35,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910995891] [2022-04-28 04:19:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:19:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:35,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {43200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43194#true} is VALID [2022-04-28 04:19:35,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {43194#true} assume true; {43194#true} is VALID [2022-04-28 04:19:35,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43194#true} {43194#true} #68#return; {43194#true} is VALID [2022-04-28 04:19:35,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {43194#true} call ULTIMATE.init(); {43200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:19:35,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {43200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43194#true} is VALID [2022-04-28 04:19:35,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {43194#true} assume true; {43194#true} is VALID [2022-04-28 04:19:35,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43194#true} {43194#true} #68#return; {43194#true} is VALID [2022-04-28 04:19:35,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {43194#true} call #t~ret8 := main(); {43194#true} is VALID [2022-04-28 04:19:35,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {43194#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {43199#(= main_~a~0 0)} is VALID [2022-04-28 04:19:35,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {43199#(= main_~a~0 0)} [198] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_388 v_main_~a~0_387)) (.cse1 (= |v_main_#t~pre7_5854| |v_main_#t~pre7_5802|)) (.cse2 (= |v_main_#t~pre4_319| |v_main_#t~pre4_318|)) (.cse3 (= v_main_~d~0_8848 v_main_~d~0_8787)) (.cse4 (= |v_main_#t~pre5_669| |v_main_#t~pre5_667|))) (or (and .cse0 (= v_main_~c~0_2811 v_main_~c~0_2800) (= v_main_~b~0_903 v_main_~b~0_900) .cse1 (= |v_main_#t~pre6_2025| |v_main_#t~pre6_2016|) .cse2 .cse3 .cse4) (and (= v_main_~b~0_900 v_main_~b~0_903) (= |v_main_#t~pre6_2016| |v_main_#t~pre6_2025|) .cse0 (= v_main_~c~0_2800 v_main_~c~0_2811) .cse1 .cse2 .cse3 .cse4))) InVars {main_#t~pre7=|v_main_#t~pre7_5854|, main_~c~0=v_main_~c~0_2811, main_~d~0=v_main_~d~0_8848, main_~b~0=v_main_~b~0_903, main_#t~pre4=|v_main_#t~pre4_319|, main_#t~pre5=|v_main_#t~pre5_669|, main_~a~0=v_main_~a~0_388, main_#t~pre6=|v_main_#t~pre6_2025|} OutVars{main_#t~pre7=|v_main_#t~pre7_5802|, main_~c~0=v_main_~c~0_2800, main_~d~0=v_main_~d~0_8787, main_~b~0=v_main_~b~0_900, main_#t~pre4=|v_main_#t~pre4_318|, main_#t~pre5=|v_main_#t~pre5_667|, main_~a~0=v_main_~a~0_387, main_#t~pre6=|v_main_#t~pre6_2016|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {43199#(= main_~a~0 0)} is VALID [2022-04-28 04:19:35,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {43199#(= main_~a~0 0)} [197] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {43195#false} is VALID [2022-04-28 04:19:35,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {43195#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {43195#false} is VALID [2022-04-28 04:19:35,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {43195#false} assume !false; {43195#false} is VALID [2022-04-28 04:19:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:19:35,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:35,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910995891] [2022-04-28 04:19:35,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910995891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:35,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:35,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:19:38,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:38,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [35177612] [2022-04-28 04:19:38,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [35177612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:38,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:38,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-28 04:19:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921478191] [2022-04-28 04:19:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 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 149 [2022-04-28 04:19:38,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:38,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:38,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:38,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-28 04:19:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-28 04:19:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4576, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 04:19:38,539 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:49,059 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2022-04-28 04:19:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-28 04:19:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 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 149 [2022-04-28 04:19:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 181 transitions. [2022-04-28 04:19:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 181 transitions. [2022-04-28 04:19:49,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 181 transitions. [2022-04-28 04:19:49,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:49,194 INFO L225 Difference]: With dead ends: 171 [2022-04-28 04:19:49,194 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 04:19:49,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 47 SyntacticMatches, 35 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5061 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=756, Invalid=17876, Unknown=0, NotChecked=0, Total=18632 [2022-04-28 04:19:49,196 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 171 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7116 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 7266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 7116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:49,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 147 Invalid, 7266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 7116 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 04:19:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 04:19:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2022-04-28 04:19:49,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:49,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 152 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:49,296 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 152 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:49,296 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 152 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:49,298 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2022-04-28 04:19:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2022-04-28 04:19:49,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:49,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:49,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 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 160 states. [2022-04-28 04:19:49,299 INFO L87 Difference]: Start difference. First operand has 152 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 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 160 states. [2022-04-28 04:19:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:49,301 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2022-04-28 04:19:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2022-04-28 04:19:49,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:49,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:49,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:49,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2022-04-28 04:19:49,303 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 149 [2022-04-28 04:19:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:49,304 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2022-04-28 04:19:49,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:19:49,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 155 transitions. [2022-04-28 04:19:49,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2022-04-28 04:19:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-28 04:19:49,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:49,760 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:49,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-04-28 04:19:49,760 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1970578849, now seen corresponding path program 62 times [2022-04-28 04:19:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:49,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [503328952] [2022-04-28 04:19:50,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult