/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_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:51:41,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:51:41,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:51:41,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:51:41,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:51:41,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:51:41,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:51:41,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:51:41,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:51:41,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:51:41,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:51:41,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:51:41,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:51:41,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:51:41,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:51:41,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:51:41,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:51:41,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:51:41,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:51:41,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:51:41,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:51:41,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:51:41,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:51:41,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:51:41,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:51:41,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:51:41,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:51:41,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:51:41,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:51:41,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:51:41,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:51:41,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:51:41,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:51:41,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:51:41,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:51:41,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:51:41,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:51:41,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:51:41,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:51:41,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:51:41,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:51:41,532 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:51:41,545 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:51:41,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:51:41,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:51:41,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:51:41,547 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:51:41,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:51:41,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:51:41,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:51:41,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:51:41,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:51:41,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:51:41,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:51:41,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:51:41,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:51:41,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:51:41,549 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:51:41,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:51:41,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:51:41,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:51:41,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:51:41,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:51:41,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:51:41,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:51:41,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:51:41,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:51:41,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:51:41,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:51:41,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:51:41,552 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:51:41,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:51:41,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:51:41,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:51:41,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:51:41,827 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:51:41,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50.c [2019-11-06 22:51:41,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1db786d5/fb9a82bd090640feac0f6a6f85b33f92/FLAGe4dc16873 [2019-11-06 22:51:42,435 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:51:42,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label50.c [2019-11-06 22:51:42,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1db786d5/fb9a82bd090640feac0f6a6f85b33f92/FLAGe4dc16873 [2019-11-06 22:51:42,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1db786d5/fb9a82bd090640feac0f6a6f85b33f92 [2019-11-06 22:51:42,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:51:42,688 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:51:42,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:42,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:51:42,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:51:42,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:42" (1/1) ... [2019-11-06 22:51:42,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2f105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:42, skipping insertion in model container [2019-11-06 22:51:42,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:42" (1/1) ... [2019-11-06 22:51:42,706 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:51:42,778 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:51:43,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:43,330 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:51:43,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:43,467 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:51:43,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43 WrapperNode [2019-11-06 22:51:43,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:43,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:51:43,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:51:43,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:51:43,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (1/1) ... [2019-11-06 22:51:43,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (1/1) ... [2019-11-06 22:51:43,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (1/1) ... [2019-11-06 22:51:43,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (1/1) ... [2019-11-06 22:51:43,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (1/1) ... [2019-11-06 22:51:43,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (1/1) ... [2019-11-06 22:51:43,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (1/1) ... [2019-11-06 22:51:43,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:51:43,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:51:43,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:51:43,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:51:43,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (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:51:43,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:51:43,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:51:43,677 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:51:43,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:51:43,677 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:51:43,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:51:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:51:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:51:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:51:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:51:43,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:51:45,060 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:51:45,061 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:51:45,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:45 BoogieIcfgContainer [2019-11-06 22:51:45,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:51:45,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:51:45,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:51:45,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:51:45,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:42" (1/3) ... [2019-11-06 22:51:45,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c22df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:45, skipping insertion in model container [2019-11-06 22:51:45,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:43" (2/3) ... [2019-11-06 22:51:45,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c22df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:45, skipping insertion in model container [2019-11-06 22:51:45,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:45" (3/3) ... [2019-11-06 22:51:45,082 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label50.c [2019-11-06 22:51:45,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:51:45,103 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:51:45,114 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:51:45,151 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:51:45,151 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:51:45,153 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:51:45,153 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:51:45,153 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:51:45,153 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:51:45,154 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:51:45,154 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:51:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:51:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 22:51:45,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:45,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:45,202 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:45,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1557712066, now seen corresponding path program 1 times [2019-11-06 22:51:45,221 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:45,222 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133688258] [2019-11-06 22:51:45,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:45,615 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:51:45,616 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133688258] [2019-11-06 22:51:45,617 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:45,617 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:51:45,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592861263] [2019-11-06 22:51:45,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:51:45,629 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:45,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:51:45,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:51:45,649 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-11-06 22:51:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:46,848 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-11-06 22:51:46,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:51:46,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-06 22:51:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:46,867 INFO L225 Difference]: With dead ends: 688 [2019-11-06 22:51:46,867 INFO L226 Difference]: Without dead ends: 372 [2019-11-06 22:51:46,875 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:51:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-06 22:51:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-11-06 22:51:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:51:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-11-06 22:51:46,980 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 43 [2019-11-06 22:51:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:46,981 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-11-06 22:51:46,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:51:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-11-06 22:51:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-06 22:51:46,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:46,994 INFO L410 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, 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] [2019-11-06 22:51:46,994 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1883069890, now seen corresponding path program 1 times [2019-11-06 22:51:46,995 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:46,996 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517167004] [2019-11-06 22:51:46,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:47,275 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517167004] [2019-11-06 22:51:47,275 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:47,275 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:51:47,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763917885] [2019-11-06 22:51:47,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:51:47,278 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:51:47,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:51:47,279 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-11-06 22:51:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:48,545 INFO L93 Difference]: Finished difference Result 936 states and 1526 transitions. [2019-11-06 22:51:48,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:51:48,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-11-06 22:51:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:48,560 INFO L225 Difference]: With dead ends: 936 [2019-11-06 22:51:48,560 INFO L226 Difference]: Without dead ends: 570 [2019-11-06 22:51:48,562 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:51:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-06 22:51:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-11-06 22:51:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-11-06 22:51:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-11-06 22:51:48,598 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 129 [2019-11-06 22:51:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:48,598 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-11-06 22:51:48,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:51:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-11-06 22:51:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-06 22:51:48,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:48,602 INFO L410 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, 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] [2019-11-06 22:51:48,602 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:48,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1079220531, now seen corresponding path program 1 times [2019-11-06 22:51:48,603 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:48,603 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248919149] [2019-11-06 22:51:48,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:48,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248919149] [2019-11-06 22:51:48,745 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:48,745 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:48,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961317244] [2019-11-06 22:51:48,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:48,749 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:48,750 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-11-06 22:51:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:50,258 INFO L93 Difference]: Finished difference Result 2220 states and 3286 transitions. [2019-11-06 22:51:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:50,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-06 22:51:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:50,269 INFO L225 Difference]: With dead ends: 2220 [2019-11-06 22:51:50,270 INFO L226 Difference]: Without dead ends: 1664 [2019-11-06 22:51:50,272 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:51:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-11-06 22:51:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-11-06 22:51:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-11-06 22:51:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2308 transitions. [2019-11-06 22:51:50,332 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2308 transitions. Word has length 138 [2019-11-06 22:51:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:50,332 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 2308 transitions. [2019-11-06 22:51:50,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2308 transitions. [2019-11-06 22:51:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-06 22:51:50,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:50,341 INFO L410 BasicCegarLoop]: trace histogram [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, 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:51:50,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 762391661, now seen corresponding path program 1 times [2019-11-06 22:51:50,342 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:50,343 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208856954] [2019-11-06 22:51:50,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 145 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:51,294 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208856954] [2019-11-06 22:51:51,295 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828957688] [2019-11-06 22:51:51,295 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:51:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:51,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 22:51:51,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:51,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-06 22:51:51,759 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:51,965 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-11-06 22:51:51,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:51,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:51,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:51,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:52,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:52,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:52,443 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:51:52,443 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 5] total 17 [2019-11-06 22:51:52,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066100994] [2019-11-06 22:51:52,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:51:52,447 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:52,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:51:52,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-06 22:51:52,449 INFO L87 Difference]: Start difference. First operand 1664 states and 2308 transitions. Second operand 5 states. [2019-11-06 22:51:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:53,903 INFO L93 Difference]: Finished difference Result 3724 states and 5204 transitions. [2019-11-06 22:51:53,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:51:53,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 274 [2019-11-06 22:51:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:53,915 INFO L225 Difference]: With dead ends: 3724 [2019-11-06 22:51:53,915 INFO L226 Difference]: Without dead ends: 2066 [2019-11-06 22:51:53,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 544 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:51:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2019-11-06 22:51:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1862. [2019-11-06 22:51:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1862 states. [2019-11-06 22:51:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2503 transitions. [2019-11-06 22:51:53,987 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2503 transitions. Word has length 274 [2019-11-06 22:51:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:53,987 INFO L462 AbstractCegarLoop]: Abstraction has 1862 states and 2503 transitions. [2019-11-06 22:51:53,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:51:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2503 transitions. [2019-11-06 22:51:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-06 22:51:53,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:53,997 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-06 22:51:54,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:54,201 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:54,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1515376597, now seen corresponding path program 1 times [2019-11-06 22:51:54,203 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:54,204 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693447875] [2019-11-06 22:51:54,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 194 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:55,273 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693447875] [2019-11-06 22:51:55,273 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4676345] [2019-11-06 22:51:55,273 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:51:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:55,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 22:51:55,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:55,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 298 proven. 53 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-06 22:51:55,746 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:55,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 116 proven. 268 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:56,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2145504583] [2019-11-06 22:51:56,387 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 359 [2019-11-06 22:51:56,436 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:51:56,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:52:10,483 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:52:10,486 INFO L272 AbstractInterpreter]: Visited 128 different actions 251 times. Merged at 4 different actions 5 times. Never widened. Performed 505 root evaluator evaluations with a maximum evaluation depth of 13. Performed 505 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:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:10,491 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:52:16,895 INFO L227 lantSequenceWeakener]: Weakened 355 states. On average, predicates are now at 77.61% of their original sizes. [2019-11-06 22:52:16,896 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:52:17,015 INFO L553 sIntCurrentIteration]: We unified 357 AI predicates to 357 [2019-11-06 22:52:17,016 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:52:17,016 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:52:17,017 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 8] total 29 [2019-11-06 22:52:17,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006407006] [2019-11-06 22:52:17,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:52:17,018 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:52:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:52:17,019 INFO L87 Difference]: Start difference. First operand 1862 states and 2503 transitions. Second operand 11 states. [2019-11-06 22:52:17,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:52:17,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:17,225 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: 14196#true or 17168#(and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (= (+ |calculate_output_#res| 1) 0)) ([#1{~a21~0 = [6;6]; calculate_output_#res = [-1;-1]; ~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:17,231 INFO L168 Benchmark]: Toolchain (without parser) took 34542.93 ms. Allocated memory was 146.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.7 MB in the beginning and 524.9 MB in the end (delta: -423.2 MB). Peak memory consumption was 894.9 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:17,232 INFO L168 Benchmark]: CDTParser took 0.22 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:17,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.20 ms. Allocated memory was 146.8 MB in the beginning and 208.1 MB in the end (delta: 61.3 MB). Free memory was 101.3 MB in the beginning and 169.1 MB in the end (delta: -67.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:17,234 INFO L168 Benchmark]: Boogie Preprocessor took 143.96 ms. Allocated memory is still 208.1 MB. Free memory was 169.1 MB in the beginning and 163.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:17,235 INFO L168 Benchmark]: RCFGBuilder took 1452.82 ms. Allocated memory was 208.1 MB in the beginning and 237.5 MB in the end (delta: 29.4 MB). Free memory was 163.6 MB in the beginning and 153.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 75.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:17,236 INFO L168 Benchmark]: TraceAbstraction took 32161.85 ms. Allocated memory was 237.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 152.1 MB in the beginning and 524.9 MB in the end (delta: -372.7 MB). Peak memory consumption was 854.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:17,240 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.22 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 778.20 ms. Allocated memory was 146.8 MB in the beginning and 208.1 MB in the end (delta: 61.3 MB). Free memory was 101.3 MB in the beginning and 169.1 MB in the end (delta: -67.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.96 ms. Allocated memory is still 208.1 MB. Free memory was 169.1 MB in the beginning and 163.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1452.82 ms. Allocated memory was 208.1 MB in the beginning and 237.5 MB in the end (delta: 29.4 MB). Free memory was 163.6 MB in the beginning and 153.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 75.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32161.85 ms. Allocated memory was 237.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 152.1 MB in the beginning and 524.9 MB in the end (delta: -372.7 MB). Peak memory consumption was 854.6 MB. 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: 14196#true or 17168#(and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (= (+ |calculate_output_#res| 1) 0)) ([#1{~a21~0 = [6;6]; calculate_output_#res = [-1;-1]; ~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: 14196#true or 17168#(and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (= (+ |calculate_output_#res| 1) 0)) ([#1{~a21~0 = [6;6]; calculate_output_#res = [-1;-1]; ~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...