java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:56:08,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:56:08,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:56:08,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:56:08,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:56:08,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:56:08,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:56:08,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:56:08,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:56:08,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:56:08,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:56:08,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:56:08,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:56:08,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:56:08,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:56:08,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:56:08,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:56:08,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:56:08,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:56:08,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:56:08,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:56:08,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:56:08,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:56:08,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:56:08,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:56:08,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:56:08,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:56:08,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:56:08,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:56:08,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:56:08,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:56:08,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:56:08,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:56:08,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:56:08,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:56:08,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:56:08,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:56:08,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:56:08,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:56:08,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:56:08,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:56:08,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:56:08,412 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:56:08,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:56:08,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:56:08,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:56:08,415 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:56:08,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:56:08,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:56:08,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:56:08,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:56:08,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:56:08,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:56:08,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:56:08,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:56:08,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:56:08,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:56:08,417 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:56:08,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:56:08,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:56:08,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:56:08,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:56:08,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:56:08,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:56:08,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:56:08,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:56:08,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:56:08,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:56:08,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:56:08,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:56:08,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:56:08,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:56:08,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:56:08,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:56:08,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:56:08,741 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:56:08,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27.c [2019-10-07 00:56:08,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0301c1ea/98a7c5b6d5d44f82a97e0485c42c0174/FLAG2bcf7261d [2019-10-07 00:56:09,434 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:56:09,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label27.c [2019-10-07 00:56:09,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0301c1ea/98a7c5b6d5d44f82a97e0485c42c0174/FLAG2bcf7261d [2019-10-07 00:56:09,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0301c1ea/98a7c5b6d5d44f82a97e0485c42c0174 [2019-10-07 00:56:09,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:56:09,665 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:56:09,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:56:09,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:56:09,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:56:09,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:56:09" (1/1) ... [2019-10-07 00:56:09,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5000c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:09, skipping insertion in model container [2019-10-07 00:56:09,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:56:09" (1/1) ... [2019-10-07 00:56:09,681 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:56:09,740 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:56:10,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:56:10,310 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:56:10,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:56:10,439 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:56:10,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10 WrapperNode [2019-10-07 00:56:10,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:56:10,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:56:10,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:56:10,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:56:10,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (1/1) ... [2019-10-07 00:56:10,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (1/1) ... [2019-10-07 00:56:10,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (1/1) ... [2019-10-07 00:56:10,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (1/1) ... [2019-10-07 00:56:10,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (1/1) ... [2019-10-07 00:56:10,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (1/1) ... [2019-10-07 00:56:10,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (1/1) ... [2019-10-07 00:56:10,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:56:10,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:56:10,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:56:10,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:56:10,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:56:10,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:56:10,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:56:10,602 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:56:10,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:56:12,579 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:56:12,579 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:56:12,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:56:12 BoogieIcfgContainer [2019-10-07 00:56:12,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:56:12,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:56:12,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:56:12,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:56:12,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:56:09" (1/3) ... [2019-10-07 00:56:12,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa0e90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:56:12, skipping insertion in model container [2019-10-07 00:56:12,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:56:10" (2/3) ... [2019-10-07 00:56:12,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa0e90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:56:12, skipping insertion in model container [2019-10-07 00:56:12,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:56:12" (3/3) ... [2019-10-07 00:56:12,589 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label27.c [2019-10-07 00:56:12,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:56:12,608 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:56:12,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:56:12,649 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:56:12,649 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:56:12,649 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:56:12,649 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:56:12,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:56:12,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:56:12,655 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:56:12,655 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:56:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-07 00:56:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:56:12,698 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:12,699 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:56:12,702 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:12,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 826812449, now seen corresponding path program 1 times [2019-10-07 00:56:12,718 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:12,719 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:12,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:12,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:13,251 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:13,251 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:13,252 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:56:13,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:56:13,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:56:13,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:56:13,275 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 4 states. [2019-10-07 00:56:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:14,063 INFO L93 Difference]: Finished difference Result 325 states and 606 transitions. [2019-10-07 00:56:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:56:14,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-07 00:56:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:14,082 INFO L225 Difference]: With dead ends: 325 [2019-10-07 00:56:14,082 INFO L226 Difference]: Without dead ends: 232 [2019-10-07 00:56:14,087 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:56:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-07 00:56:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 157. [2019-10-07 00:56:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 00:56:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-07 00:56:14,158 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-07 00:56:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:14,159 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-07 00:56:14,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:56:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-07 00:56:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 00:56:14,165 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:14,165 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:56:14,165 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:14,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1195674184, now seen corresponding path program 1 times [2019-10-07 00:56:14,166 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:14,167 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:14,167 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:14,167 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:14,277 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:14,277 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:14,277 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:56:14,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:56:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:56:14,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:56:14,281 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-07 00:56:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:14,863 INFO L93 Difference]: Finished difference Result 479 states and 882 transitions. [2019-10-07 00:56:14,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:56:14,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-07 00:56:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:14,874 INFO L225 Difference]: With dead ends: 479 [2019-10-07 00:56:14,874 INFO L226 Difference]: Without dead ends: 327 [2019-10-07 00:56:14,876 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:56:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-07 00:56:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2019-10-07 00:56:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-07 00:56:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 558 transitions. [2019-10-07 00:56:14,923 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 558 transitions. Word has length 87 [2019-10-07 00:56:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:14,923 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 558 transitions. [2019-10-07 00:56:14,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:56:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 558 transitions. [2019-10-07 00:56:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 00:56:14,929 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:14,929 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:56:14,929 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:14,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2128695788, now seen corresponding path program 1 times [2019-10-07 00:56:14,930 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:14,930 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:14,930 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:14,931 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:15,106 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:15,106 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:15,106 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:56:15,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:56:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:56:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:56:15,108 INFO L87 Difference]: Start difference. First operand 315 states and 558 transitions. Second operand 3 states. [2019-10-07 00:56:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:15,519 INFO L93 Difference]: Finished difference Result 852 states and 1540 transitions. [2019-10-07 00:56:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:56:15,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-07 00:56:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:15,528 INFO L225 Difference]: With dead ends: 852 [2019-10-07 00:56:15,528 INFO L226 Difference]: Without dead ends: 542 [2019-10-07 00:56:15,532 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:56:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-07 00:56:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2019-10-07 00:56:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-07 00:56:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 923 transitions. [2019-10-07 00:56:15,587 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 923 transitions. Word has length 88 [2019-10-07 00:56:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:15,588 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 923 transitions. [2019-10-07 00:56:15,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:56:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 923 transitions. [2019-10-07 00:56:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 00:56:15,593 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:15,593 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:56:15,594 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:15,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1641056516, now seen corresponding path program 1 times [2019-10-07 00:56:15,594 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:15,594 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:15,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:15,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:15,690 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:15,690 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:15,691 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:56:15,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:56:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:56:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:56:15,692 INFO L87 Difference]: Start difference. First operand 542 states and 923 transitions. Second operand 6 states. [2019-10-07 00:56:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:16,391 INFO L93 Difference]: Finished difference Result 1421 states and 2525 transitions. [2019-10-07 00:56:16,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:56:16,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-07 00:56:16,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:16,400 INFO L225 Difference]: With dead ends: 1421 [2019-10-07 00:56:16,400 INFO L226 Difference]: Without dead ends: 884 [2019-10-07 00:56:16,404 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:56:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-10-07 00:56:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 866. [2019-10-07 00:56:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-10-07 00:56:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1450 transitions. [2019-10-07 00:56:16,459 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1450 transitions. Word has length 100 [2019-10-07 00:56:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:16,459 INFO L462 AbstractCegarLoop]: Abstraction has 866 states and 1450 transitions. [2019-10-07 00:56:16,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:56:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1450 transitions. [2019-10-07 00:56:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-07 00:56:16,464 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:16,464 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:56:16,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash -498208855, now seen corresponding path program 1 times [2019-10-07 00:56:16,465 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:16,465 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:16,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:16,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:16,543 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:16,543 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:56:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:56:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:16,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:56:16,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:56:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 00:56:16,749 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:56:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 00:56:16,834 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:56:16,834 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-07 00:56:16,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:56:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:56:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:56:16,838 INFO L87 Difference]: Start difference. First operand 866 states and 1450 transitions. Second operand 3 states. [2019-10-07 00:56:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:17,341 INFO L93 Difference]: Finished difference Result 1727 states and 2913 transitions. [2019-10-07 00:56:17,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:56:17,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-07 00:56:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:17,351 INFO L225 Difference]: With dead ends: 1727 [2019-10-07 00:56:17,351 INFO L226 Difference]: Without dead ends: 866 [2019-10-07 00:56:17,355 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:56:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-10-07 00:56:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 791. [2019-10-07 00:56:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-07 00:56:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1271 transitions. [2019-10-07 00:56:17,399 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1271 transitions. Word has length 111 [2019-10-07 00:56:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:17,400 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1271 transitions. [2019-10-07 00:56:17,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:56:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1271 transitions. [2019-10-07 00:56:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-07 00:56:17,406 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:56:17,406 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:56:17,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:56:17,612 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:56:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:56:17,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1740725880, now seen corresponding path program 1 times [2019-10-07 00:56:17,613 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:56:17,613 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:17,613 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:17,614 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:56:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:56:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:56:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:56:17,824 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:56:17,824 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:56:17,824 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:56:17,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:56:17,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:56:17,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:56:17,826 INFO L87 Difference]: Start difference. First operand 791 states and 1271 transitions. Second operand 3 states. [2019-10-07 00:56:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:56:18,173 INFO L93 Difference]: Finished difference Result 1727 states and 2795 transitions. [2019-10-07 00:56:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:56:18,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-07 00:56:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:56:18,176 INFO L225 Difference]: With dead ends: 1727 [2019-10-07 00:56:18,176 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:56:18,181 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:56:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:56:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:56:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:56:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:56:18,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2019-10-07 00:56:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:56:18,187 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:56:18,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:56:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:56:18,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:56:18,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:56:18,661 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-10-07 00:56:18,771 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a16~0 |old(~a16~0)|) (= ~a8~0 |old(~a8~0)|)) [2019-10-07 00:56:18,771 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:56:18,771 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-07 00:56:18,772 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-07 00:56:18,772 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-07 00:56:18,772 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-07 00:56:18,772 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2019-10-07 00:56:18,772 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-07 00:56:18,773 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-07 00:56:18,773 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:56:18,773 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-07 00:56:18,773 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-07 00:56:18,773 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-07 00:56:18,773 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-07 00:56:18,774 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-07 00:56:18,774 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-07 00:56:18,774 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-07 00:56:18,774 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-07 00:56:18,774 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:56:18,774 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-07 00:56:18,774 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-07 00:56:18,775 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-07 00:56:18,775 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-07 00:56:18,775 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-07 00:56:18,775 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-07 00:56:18,775 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-07 00:56:18,775 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-07 00:56:18,776 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-07 00:56:18,776 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-07 00:56:18,776 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-07 00:56:18,776 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-07 00:56:18,776 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-07 00:56:18,776 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-07 00:56:18,776 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-07 00:56:18,777 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-07 00:56:18,777 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:56:18,777 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:56:18,777 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-07 00:56:18,777 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-07 00:56:18,777 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-07 00:56:18,777 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-07 00:56:18,778 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-07 00:56:18,778 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-07 00:56:18,778 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-07 00:56:18,778 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-07 00:56:18,778 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-07 00:56:18,779 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-07 00:56:18,779 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-07 00:56:18,779 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-07 00:56:18,779 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-07 00:56:18,779 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-07 00:56:18,779 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-07 00:56:18,779 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-07 00:56:18,780 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-07 00:56:18,780 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse4 (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0)))) (.cse0 (= 6 |old(~a16~0)|)) (.cse1 (= ~a17~0 1)) (.cse5 (and (= |old(~a7~0)| |old(~a20~0)|) (= 1 |old(~a20~0)|))) (.cse3 (not (= 1 |old(~a17~0)|))) (.cse6 (= ~a16~0 |old(~a16~0)|)) (.cse7 (= ~a8~0 |old(~a8~0)|)) (.cse2 (= 15 |old(~a8~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5) (or (and .cse6 .cse7 .cse4) (or (= 13 |old(~a8~0)|) .cse5)) (or (and .cse1 .cse4) .cse5 .cse2 .cse3) (or .cse0 .cse1 .cse5 .cse3) (or (and .cse6 .cse7) .cse2))) [2019-10-07 00:56:18,780 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-07 00:56:18,781 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-07 00:56:18,781 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-07 00:56:18,781 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-07 00:56:18,781 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-07 00:56:18,781 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-07 00:56:18,781 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-07 00:56:18,782 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-07 00:56:18,783 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-07 00:56:18,783 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-07 00:56:18,783 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-07 00:56:18,783 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:56:18,783 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 6)) (= ~a17~0 1) (not (= ~a20~0 ~a7~0)) (not (= ~a8~0 13))) [2019-10-07 00:56:18,783 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:56:18,783 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:56:18,783 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (and (= ~a16~0 |old(~a16~0)|) (= ~a8~0 |old(~a8~0)|) (= ~a17~0 1) (not (= ~a20~0 ~a7~0))) (= |old(~a7~0)| |old(~a20~0)|) (not (= 1 |old(~a17~0)|))) [2019-10-07 00:56:18,783 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:56:18,784 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (not (= 15 ~a8~0)) (= |old(~a7~0)| |old(~a20~0)|) (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0))) (not (= 1 |old(~a17~0)|))) [2019-10-07 00:56:18,784 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-07 00:56:18,784 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-07 00:56:18,784 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (not (= 15 ~a8~0)) (= |old(~a7~0)| |old(~a20~0)|) (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0))) (not (= 1 |old(~a17~0)|))) [2019-10-07 00:56:18,784 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:56:18,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:56:18 BoogieIcfgContainer [2019-10-07 00:56:18,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:56:18,803 INFO L168 Benchmark]: Toolchain (without parser) took 9137.74 ms. Allocated memory was 145.2 MB in the beginning and 338.2 MB in the end (delta: 192.9 MB). Free memory was 101.5 MB in the beginning and 104.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 190.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:18,804 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:56:18,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.10 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 101.3 MB in the beginning and 171.2 MB in the end (delta: -69.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:18,806 INFO L168 Benchmark]: Boogie Preprocessor took 110.24 ms. Allocated memory is still 205.5 MB. Free memory was 171.2 MB in the beginning and 166.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:18,807 INFO L168 Benchmark]: RCFGBuilder took 2029.26 ms. Allocated memory was 205.5 MB in the beginning and 253.2 MB in the end (delta: 47.7 MB). Free memory was 166.3 MB in the beginning and 214.1 MB in the end (delta: -47.8 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:18,808 INFO L168 Benchmark]: TraceAbstraction took 6219.07 ms. Allocated memory was 253.2 MB in the beginning and 338.2 MB in the end (delta: 84.9 MB). Free memory was 214.1 MB in the beginning and 104.0 MB in the end (delta: 110.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:56:18,813 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.10 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 101.3 MB in the beginning and 171.2 MB in the end (delta: -69.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.24 ms. Allocated memory is still 205.5 MB. Free memory was 171.2 MB in the beginning and 166.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2029.26 ms. Allocated memory was 205.5 MB in the beginning and 253.2 MB in the end (delta: 47.7 MB). Free memory was 166.3 MB in the beginning and 214.1 MB in the end (delta: -47.8 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6219.07 ms. Allocated memory was 253.2 MB in the beginning and 338.2 MB in the end (delta: 84.9 MB). Free memory was 214.1 MB in the beginning and 104.0 MB in the end (delta: 110.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((6 == \old(a16) || 13 == \old(a8)) || !(15 == a8)) || \old(a7) == \old(a20)) || !(1 == a7) || !(a20 == a7)) || !(1 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 400 SDtfs, 890 SDslu, 117 SDs, 0 SdLazy, 1756 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 180 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 53 PreInvPairs, 77 NumberOfFragments, 226 HoareAnnotationTreeSize, 53 FomulaSimplifications, 1155 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 611 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 788 ConstructedInterpolants, 0 QuantifiedInterpolants, 218984 SizeOfPredicates, 2 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 181/183 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...