/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:52:01,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:52:01,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:52:01,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:52:01,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:52:01,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:52:01,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:52:01,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:52:01,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:52:01,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:52:01,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:52:01,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:52:01,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:52:01,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:52:01,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:52:01,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:52:01,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:52:01,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:52:01,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:52:01,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:52:01,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:52:01,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:52:01,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:52:01,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:52:01,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:52:01,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:52:01,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:52:01,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:52:01,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:52:01,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:52:01,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:52:01,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:52:01,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:52:01,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:52:01,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:52:01,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:52:01,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:52:01,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:52:01,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:52:01,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:52:01,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:52:01,602 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-11-06 22:52:01,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:52:01,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:52:01,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:52:01,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:52:01,630 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:52:01,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:52:01,631 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:52:01,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:52:01,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:52:01,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:52:01,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:52:01,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:52:01,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:52:01,633 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:52:01,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:52:01,634 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:52:01,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:52:01,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:52:01,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:52:01,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:52:01,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:52:01,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:52:01,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:52:01,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:52:01,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:52:01,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:52:01,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:52:01,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:52:01,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:52:01,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:52:01,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:52:01,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:52:01,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:52:01,942 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:52:01,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label56.c [2019-11-06 22:52:02,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93059d397/29d2920a813a44d68645a09a0f0ced21/FLAG45c76df21 [2019-11-06 22:52:02,636 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:52:02,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label56.c [2019-11-06 22:52:02,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93059d397/29d2920a813a44d68645a09a0f0ced21/FLAG45c76df21 [2019-11-06 22:52:02,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93059d397/29d2920a813a44d68645a09a0f0ced21 [2019-11-06 22:52:02,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:52:02,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:52:02,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:52:02,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:52:02,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:52:02,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:02" (1/1) ... [2019-11-06 22:52:02,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3f1635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:02, skipping insertion in model container [2019-11-06 22:52:02,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:02" (1/1) ... [2019-11-06 22:52:02,933 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:52:03,003 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:52:03,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:52:03,588 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:52:03,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:52:03,735 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:52:03,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03 WrapperNode [2019-11-06 22:52:03,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:52:03,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:52:03,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:52:03,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:52:03,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (1/1) ... [2019-11-06 22:52:03,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (1/1) ... [2019-11-06 22:52:03,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (1/1) ... [2019-11-06 22:52:03,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (1/1) ... [2019-11-06 22:52:03,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (1/1) ... [2019-11-06 22:52:03,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (1/1) ... [2019-11-06 22:52:03,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (1/1) ... [2019-11-06 22:52:03,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:52:03,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:52:03,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:52:03,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:52:03,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (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-11-06 22:52:03,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:52:03,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:52:03,984 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:52:03,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:52:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:52:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:52:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:52:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:52:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:52:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:52:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:52:05,802 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:52:05,803 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:52:05,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:05 BoogieIcfgContainer [2019-11-06 22:52:05,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:52:05,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:52:05,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:52:05,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:52:05,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:52:02" (1/3) ... [2019-11-06 22:52:05,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590b158e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:05, skipping insertion in model container [2019-11-06 22:52:05,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:03" (2/3) ... [2019-11-06 22:52:05,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590b158e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:05, skipping insertion in model container [2019-11-06 22:52:05,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:05" (3/3) ... [2019-11-06 22:52:05,812 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label56.c [2019-11-06 22:52:05,822 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:52:05,831 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:52:05,842 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:52:05,871 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:52:05,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:52:05,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:52:05,872 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:52:05,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:52:05,872 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:52:05,872 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:52:05,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:52:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:52:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 22:52:05,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:05,917 INFO L410 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] [2019-11-06 22:52:05,918 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:05,924 INFO L82 PathProgramCache]: Analyzing trace with hash -718662862, now seen corresponding path program 1 times [2019-11-06 22:52:05,932 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:05,932 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284876056] [2019-11-06 22:52:05,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:06,199 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284876056] [2019-11-06 22:52:06,200 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:06,200 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:52:06,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261603057] [2019-11-06 22:52:06,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:52:06,210 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:52:06,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:06,229 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-11-06 22:52:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:07,599 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-11-06 22:52:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:52:07,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 22:52:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:07,632 INFO L225 Difference]: With dead ends: 688 [2019-11-06 22:52:07,633 INFO L226 Difference]: Without dead ends: 372 [2019-11-06 22:52:07,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-06 22:52:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-11-06 22:52:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:52:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-11-06 22:52:07,756 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 23 [2019-11-06 22:52:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:07,756 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-11-06 22:52:07,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:52:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-11-06 22:52:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-06 22:52:07,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:07,783 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:52:07,783 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1766651886, now seen corresponding path program 1 times [2019-11-06 22:52:07,784 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:07,784 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14056231] [2019-11-06 22:52:07,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:08,082 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14056231] [2019-11-06 22:52:08,082 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:08,083 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:52:08,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058570820] [2019-11-06 22:52:08,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:52:08,086 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:52:08,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:52:08,087 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-11-06 22:52:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:09,446 INFO L93 Difference]: Finished difference Result 936 states and 1526 transitions. [2019-11-06 22:52:09,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:52:09,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-06 22:52:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:09,452 INFO L225 Difference]: With dead ends: 936 [2019-11-06 22:52:09,453 INFO L226 Difference]: Without dead ends: 570 [2019-11-06 22:52:09,455 INFO L630 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-11-06 22:52:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-06 22:52:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-11-06 22:52:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-11-06 22:52:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-11-06 22:52:09,504 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 109 [2019-11-06 22:52:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:09,505 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-11-06 22:52:09,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:52:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-11-06 22:52:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-06 22:52:09,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:09,518 INFO L410 BasicCegarLoop]: trace histogram [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, 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-11-06 22:52:09,519 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:09,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1723912061, now seen corresponding path program 1 times [2019-11-06 22:52:09,520 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:09,520 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715458956] [2019-11-06 22:52:09,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:09,683 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715458956] [2019-11-06 22:52:09,684 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:09,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:52:09,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744660760] [2019-11-06 22:52:09,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:52:09,687 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:52:09,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:52:09,688 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-11-06 22:52:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:11,268 INFO L93 Difference]: Finished difference Result 2220 states and 3283 transitions. [2019-11-06 22:52:11,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:52:11,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-06 22:52:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:11,277 INFO L225 Difference]: With dead ends: 2220 [2019-11-06 22:52:11,277 INFO L226 Difference]: Without dead ends: 1664 [2019-11-06 22:52:11,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-06 22:52:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-11-06 22:52:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-11-06 22:52:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-11-06 22:52:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2318 transitions. [2019-11-06 22:52:11,337 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2318 transitions. Word has length 118 [2019-11-06 22:52:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:11,338 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 2318 transitions. [2019-11-06 22:52:11,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:52:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2318 transitions. [2019-11-06 22:52:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-06 22:52:11,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:11,347 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2019-11-06 22:52:11,347 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash -718289567, now seen corresponding path program 1 times [2019-11-06 22:52:11,348 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:11,348 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161488709] [2019-11-06 22:52:11,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 122 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:11,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161488709] [2019-11-06 22:52:11,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663185910] [2019-11-06 22:52:11,756 INFO L94 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-11-06 22:52:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:11,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 22:52:11,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:52:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 22:52:12,178 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:52:12,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:12,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:12,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:12,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:12,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 32 proven. 101 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:12,744 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:52:12,744 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2019-11-06 22:52:12,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003154454] [2019-11-06 22:52:12,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:52:12,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:52:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:52:12,746 INFO L87 Difference]: Start difference. First operand 1664 states and 2318 transitions. Second operand 5 states. [2019-11-06 22:52:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:14,269 INFO L93 Difference]: Finished difference Result 3542 states and 4976 transitions. [2019-11-06 22:52:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:52:14,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-11-06 22:52:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:14,282 INFO L225 Difference]: With dead ends: 3542 [2019-11-06 22:52:14,282 INFO L226 Difference]: Without dead ends: 1884 [2019-11-06 22:52:14,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:52:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2019-11-06 22:52:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1502. [2019-11-06 22:52:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-11-06 22:52:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2078 transitions. [2019-11-06 22:52:14,343 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2078 transitions. Word has length 240 [2019-11-06 22:52:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:14,344 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 2078 transitions. [2019-11-06 22:52:14,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:52:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2078 transitions. [2019-11-06 22:52:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-06 22:52:14,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:14,351 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-06 22:52:14,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:14,555 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:14,556 INFO L82 PathProgramCache]: Analyzing trace with hash -528490103, now seen corresponding path program 1 times [2019-11-06 22:52:14,556 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:14,556 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719274473] [2019-11-06 22:52:14,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 134 proven. 183 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:15,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719274473] [2019-11-06 22:52:15,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902220175] [2019-11-06 22:52:15,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:15,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 22:52:15,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:52:15,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:52:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 251 proven. 53 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 22:52:15,762 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:52:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:52:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 56 proven. 261 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:16,302 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [707286800] [2019-11-06 22:52:16,307 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 325 [2019-11-06 22:52:16,358 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:52:16,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:52:29,676 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:52:29,679 INFO L272 AbstractInterpreter]: Visited 121 different actions 237 times. Merged at 4 different actions 5 times. Never widened. Performed 485 root evaluator evaluations with a maximum evaluation depth of 13. Performed 485 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-11-06 22:52:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:29,683 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:52:34,607 INFO L227 lantSequenceWeakener]: Weakened 321 states. On average, predicates are now at 77.36% of their original sizes. [2019-11-06 22:52:34,607 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:52:34,694 INFO L553 sIntCurrentIteration]: We unified 323 AI predicates to 323 [2019-11-06 22:52:34,694 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:52:34,696 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:52:34,696 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 8] total 29 [2019-11-06 22:52:34,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557803749] [2019-11-06 22:52:34,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:52:34,698 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:34,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:52:34,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:52:34,699 INFO L87 Difference]: Start difference. First operand 1502 states and 2078 transitions. Second operand 11 states. [2019-11-06 22:52:34,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:52:34,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:34,914 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 13436#true or 16049#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; }, {~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-06 22:52:34,927 INFO L168 Benchmark]: Toolchain (without parser) took 32008.30 ms. Allocated memory was 146.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:34,929 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:52:34,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.80 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 100.9 MB in the beginning and 160.5 MB in the end (delta: -59.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:34,940 INFO L168 Benchmark]: Boogie Preprocessor took 177.49 ms. Allocated memory is still 205.5 MB. Free memory was 160.5 MB in the beginning and 155.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:34,943 INFO L168 Benchmark]: RCFGBuilder took 1890.26 ms. Allocated memory was 205.5 MB in the beginning and 237.0 MB in the end (delta: 31.5 MB). Free memory was 155.2 MB in the beginning and 145.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:34,944 INFO L168 Benchmark]: TraceAbstraction took 29115.92 ms. Allocated memory was 237.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 145.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 22:52:34,961 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.76 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.80 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 100.9 MB in the beginning and 160.5 MB in the end (delta: -59.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 177.49 ms. Allocated memory is still 205.5 MB. Free memory was 160.5 MB in the beginning and 155.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1890.26 ms. Allocated memory was 205.5 MB in the beginning and 237.0 MB in the end (delta: 31.5 MB). Free memory was 155.2 MB in the beginning and 145.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29115.92 ms. Allocated memory was 237.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 145.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at least one of both input predicates is unknown: 13436#true or 16049#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; }, {~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 13436#true or 16049#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; }, {~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }]): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...