/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_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:51:58,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:51:58,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:51:58,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:51:58,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:51:58,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:51:58,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:51:58,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:51:58,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:51:58,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:51:58,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:51:58,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:51:58,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:51:58,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:51:58,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:51:58,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:51:58,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:51:58,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:51:58,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:51:58,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:51:58,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:51:58,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:51:58,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:51:58,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:51:58,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:51:58,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:51:58,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:51:58,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:51:58,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:51:58,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:51:58,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:51:58,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:51:58,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:51:58,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:51:58,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:51:58,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:51:58,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:51:58,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:51:58,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:51:58,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:51:58,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:51:58,345 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:58,370 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:51:58,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:51:58,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:51:58,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:51:58,373 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:51:58,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:51:58,373 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:51:58,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:51:58,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:51:58,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:51:58,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:51:58,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:51:58,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:51:58,376 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:51:58,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:51:58,376 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:51:58,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:51:58,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:51:58,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:51:58,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:51:58,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:51:58,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:51:58,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:51:58,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:51:58,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:51:58,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:51:58,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:51:58,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:51:58,379 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:58,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:51:58,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:51:58,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:51:58,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:51:58,683 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:51:58,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label54.c [2019-11-06 22:51:58,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d049b8efd/b93551483456489087e5073c1d3df583/FLAG34c9249a7 [2019-11-06 22:51:59,308 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:51:59,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label54.c [2019-11-06 22:51:59,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d049b8efd/b93551483456489087e5073c1d3df583/FLAG34c9249a7 [2019-11-06 22:51:59,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d049b8efd/b93551483456489087e5073c1d3df583 [2019-11-06 22:51:59,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:51:59,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:51:59,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:59,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:51:59,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:51:59,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26cda43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59, skipping insertion in model container [2019-11-06 22:51:59,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,543 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:51:59,604 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:52:00,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:52:00,160 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:52:00,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:52:00,343 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:52:00,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:00 WrapperNode [2019-11-06 22:52:00,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:52:00,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:52:00,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:52:00,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:52:00,359 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:00" (1/1) ... [2019-11-06 22:52:00,359 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:00" (1/1) ... [2019-11-06 22:52:00,380 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:00" (1/1) ... [2019-11-06 22:52:00,380 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:00" (1/1) ... [2019-11-06 22:52:00,422 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:00" (1/1) ... [2019-11-06 22:52:00,441 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:00" (1/1) ... [2019-11-06 22:52:00,446 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:00" (1/1) ... [2019-11-06 22:52:00,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:52:00,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:52:00,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:52:00,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:52:00,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:00" (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:00,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:52:00,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:52:00,526 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:52:00,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:52:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:52:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:52:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:52:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:52:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:52:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:52:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:52:01,942 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:52:01,942 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:52:01,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:01 BoogieIcfgContainer [2019-11-06 22:52:01,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:52:01,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:52:01,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:52:01,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:52:01,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:59" (1/3) ... [2019-11-06 22:52:01,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549dc264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:01, skipping insertion in model container [2019-11-06 22:52:01,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:00" (2/3) ... [2019-11-06 22:52:01,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549dc264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:01, skipping insertion in model container [2019-11-06 22:52:01,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:01" (3/3) ... [2019-11-06 22:52:01,952 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label54.c [2019-11-06 22:52:01,963 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:52:01,974 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:52:01,985 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:52:02,011 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:52:02,012 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:52:02,012 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:52:02,012 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:52:02,012 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:52:02,012 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:52:02,012 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:52:02,012 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:52:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:52:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-06 22:52:02,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:02,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:52:02,044 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash 856083907, now seen corresponding path program 1 times [2019-11-06 22:52:02,059 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:02,060 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635195339] [2019-11-06 22:52:02,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:02,245 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:02,248 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635195339] [2019-11-06 22:52:02,249 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:02,249 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:52:02,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234724573] [2019-11-06 22:52:02,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:52:02,258 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:02,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:52:02,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:02,275 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-11-06 22:52:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:03,613 INFO L93 Difference]: Finished difference Result 704 states and 1239 transitions. [2019-11-06 22:52:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:52:03,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-06 22:52:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:03,648 INFO L225 Difference]: With dead ends: 704 [2019-11-06 22:52:03,649 INFO L226 Difference]: Without dead ends: 372 [2019-11-06 22:52:03,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-06 22:52:03,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-11-06 22:52:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:52:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 524 transitions. [2019-11-06 22:52:03,767 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 524 transitions. Word has length 12 [2019-11-06 22:52:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:03,767 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 524 transitions. [2019-11-06 22:52:03,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:52:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 524 transitions. [2019-11-06 22:52:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-06 22:52:03,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:03,773 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:52:03,773 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:03,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1019209391, now seen corresponding path program 1 times [2019-11-06 22:52:03,774 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:03,774 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632476743] [2019-11-06 22:52:03,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:03,955 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632476743] [2019-11-06 22:52:03,955 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:03,955 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:52:03,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748012667] [2019-11-06 22:52:03,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:52:03,958 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:03,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:52:03,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:03,958 INFO L87 Difference]: Start difference. First operand 372 states and 524 transitions. Second operand 3 states. [2019-11-06 22:52:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:04,964 INFO L93 Difference]: Finished difference Result 1102 states and 1568 transitions. [2019-11-06 22:52:04,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:52:04,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-06 22:52:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:04,976 INFO L225 Difference]: With dead ends: 1102 [2019-11-06 22:52:04,976 INFO L226 Difference]: Without dead ends: 736 [2019-11-06 22:52:04,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-06 22:52:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-11-06 22:52:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-11-06 22:52:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 968 transitions. [2019-11-06 22:52:05,042 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 968 transitions. Word has length 95 [2019-11-06 22:52:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:05,043 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 968 transitions. [2019-11-06 22:52:05,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:52:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 968 transitions. [2019-11-06 22:52:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 22:52:05,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:05,050 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:52:05,050 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:05,050 INFO L82 PathProgramCache]: Analyzing trace with hash -788431111, now seen corresponding path program 1 times [2019-11-06 22:52:05,051 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:05,053 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252738545] [2019-11-06 22:52:05,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:05,216 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252738545] [2019-11-06 22:52:05,216 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:05,217 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:52:05,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638965334] [2019-11-06 22:52:05,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:52:05,219 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:05,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:52:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:05,220 INFO L87 Difference]: Start difference. First operand 736 states and 968 transitions. Second operand 3 states. [2019-11-06 22:52:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:06,188 INFO L93 Difference]: Finished difference Result 1830 states and 2479 transitions. [2019-11-06 22:52:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:52:06,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-06 22:52:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:06,196 INFO L225 Difference]: With dead ends: 1830 [2019-11-06 22:52:06,197 INFO L226 Difference]: Without dead ends: 1100 [2019-11-06 22:52:06,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-11-06 22:52:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1100. [2019-11-06 22:52:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-11-06 22:52:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1450 transitions. [2019-11-06 22:52:06,252 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1450 transitions. Word has length 107 [2019-11-06 22:52:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:06,256 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 1450 transitions. [2019-11-06 22:52:06,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:52:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1450 transitions. [2019-11-06 22:52:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-06 22:52:06,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:06,262 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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:06,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:06,267 INFO L82 PathProgramCache]: Analyzing trace with hash 481187826, now seen corresponding path program 1 times [2019-11-06 22:52:06,267 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:06,267 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339659950] [2019-11-06 22:52:06,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:06,402 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339659950] [2019-11-06 22:52:06,402 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:06,403 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:52:06,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025966571] [2019-11-06 22:52:06,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:52:06,404 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:06,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:52:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:06,404 INFO L87 Difference]: Start difference. First operand 1100 states and 1450 transitions. Second operand 3 states. [2019-11-06 22:52:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:07,338 INFO L93 Difference]: Finished difference Result 2740 states and 3701 transitions. [2019-11-06 22:52:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:52:07,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-06 22:52:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:07,347 INFO L225 Difference]: With dead ends: 2740 [2019-11-06 22:52:07,347 INFO L226 Difference]: Without dead ends: 1646 [2019-11-06 22:52:07,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-11-06 22:52:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2019-11-06 22:52:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-11-06 22:52:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2108 transitions. [2019-11-06 22:52:07,441 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2108 transitions. Word has length 124 [2019-11-06 22:52:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:07,442 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 2108 transitions. [2019-11-06 22:52:07,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:52:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2108 transitions. [2019-11-06 22:52:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-06 22:52:07,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:07,445 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,446 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:07,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1056936878, now seen corresponding path program 1 times [2019-11-06 22:52:07,446 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:07,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665298854] [2019-11-06 22:52:07,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:07,537 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665298854] [2019-11-06 22:52:07,537 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:07,537 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:52:07,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521413679] [2019-11-06 22:52:07,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:52:07,539 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:52:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:07,540 INFO L87 Difference]: Start difference. First operand 1646 states and 2108 transitions. Second operand 3 states. [2019-11-06 22:52:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:08,368 INFO L93 Difference]: Finished difference Result 3832 states and 5023 transitions. [2019-11-06 22:52:08,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:52:08,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-11-06 22:52:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:08,379 INFO L225 Difference]: With dead ends: 3832 [2019-11-06 22:52:08,379 INFO L226 Difference]: Without dead ends: 2192 [2019-11-06 22:52:08,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-11-06 22:52:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2192. [2019-11-06 22:52:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-11-06 22:52:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2772 transitions. [2019-11-06 22:52:08,438 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2772 transitions. Word has length 142 [2019-11-06 22:52:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:08,438 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 2772 transitions. [2019-11-06 22:52:08,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:52:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2772 transitions. [2019-11-06 22:52:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-06 22:52:08,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:08,444 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-06 22:52:08,445 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:08,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1291514030, now seen corresponding path program 1 times [2019-11-06 22:52:08,445 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:08,445 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273600997] [2019-11-06 22:52:08,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 10 proven. 99 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:08,708 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273600997] [2019-11-06 22:52:08,708 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767576745] [2019-11-06 22:52:08,708 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:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:08,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 22:52:08,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:52:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 22:52:09,040 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:52:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 10 proven. 99 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:09,235 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:52:09,235 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-11-06 22:52:09,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608117581] [2019-11-06 22:52:09,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:52:09,237 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:09,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:52:09,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:52:09,238 INFO L87 Difference]: Start difference. First operand 2192 states and 2772 transitions. Second operand 5 states. [2019-11-06 22:52:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:10,696 INFO L93 Difference]: Finished difference Result 5350 states and 7129 transitions. [2019-11-06 22:52:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:52:10,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-11-06 22:52:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:10,717 INFO L225 Difference]: With dead ends: 5350 [2019-11-06 22:52:10,717 INFO L226 Difference]: Without dead ends: 3346 [2019-11-06 22:52:10,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 504 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:52:10,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-11-06 22:52:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3306. [2019-11-06 22:52:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-11-06 22:52:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4121 transitions. [2019-11-06 22:52:10,809 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4121 transitions. Word has length 255 [2019-11-06 22:52:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:10,810 INFO L462 AbstractCegarLoop]: Abstraction has 3306 states and 4121 transitions. [2019-11-06 22:52:10,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:52:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4121 transitions. [2019-11-06 22:52:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-06 22:52:10,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:10,816 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 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] [2019-11-06 22:52:11,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:11,021 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 265461364, now seen corresponding path program 1 times [2019-11-06 22:52:11,022 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:11,022 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281420606] [2019-11-06 22:52:11,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 101 proven. 142 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:11,747 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281420606] [2019-11-06 22:52:11,747 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923721030] [2019-11-06 22:52:11,747 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:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:11,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:52:11,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:52:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-06 22:52:11,976 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:52:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-06 22:52:12,063 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:52:12,063 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [12] total 13 [2019-11-06 22:52:12,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291660281] [2019-11-06 22:52:12,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:52:12,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:12,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:52:12,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:52:12,065 INFO L87 Difference]: Start difference. First operand 3306 states and 4121 transitions. Second operand 3 states. [2019-11-06 22:52:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:12,925 INFO L93 Difference]: Finished difference Result 7880 states and 9850 transitions. [2019-11-06 22:52:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:52:12,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-11-06 22:52:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:12,945 INFO L225 Difference]: With dead ends: 7880 [2019-11-06 22:52:12,946 INFO L226 Difference]: Without dead ends: 4034 [2019-11-06 22:52:12,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 563 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:52:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2019-11-06 22:52:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2019-11-06 22:52:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2019-11-06 22:52:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 4865 transitions. [2019-11-06 22:52:13,050 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 4865 transitions. Word has length 282 [2019-11-06 22:52:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:13,051 INFO L462 AbstractCegarLoop]: Abstraction has 4034 states and 4865 transitions. [2019-11-06 22:52:13,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:52:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 4865 transitions. [2019-11-06 22:52:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-06 22:52:13,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:13,059 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 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] [2019-11-06 22:52:13,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:13,263 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:13,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1082331696, now seen corresponding path program 1 times [2019-11-06 22:52:13,265 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:13,265 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849556490] [2019-11-06 22:52:13,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 101 proven. 146 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:14,121 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849556490] [2019-11-06 22:52:14,121 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431022526] [2019-11-06 22:52:14,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:14,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:52:14,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:52:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-06 22:52:14,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:52:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-06 22:52:14,489 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1207544884] [2019-11-06 22:52:14,496 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 285 [2019-11-06 22:52:14,562 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:52:14,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:52:27,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:52:27,764 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:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:27,768 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:52:31,857 INFO L227 lantSequenceWeakener]: Weakened 281 states. On average, predicates are now at 77.2% of their original sizes. [2019-11-06 22:52:31,857 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:52:31,947 INFO L553 sIntCurrentIteration]: We unified 283 AI predicates to 283 [2019-11-06 22:52:31,947 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:52:31,948 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:52:31,948 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 5, 5] total 26 [2019-11-06 22:52:31,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953450168] [2019-11-06 22:52:31,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:52:31,950 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:52:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-11-06 22:52:31,951 INFO L87 Difference]: Start difference. First operand 4034 states and 4865 transitions. Second operand 11 states. [2019-11-06 22:52:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:52:32,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:32,157 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: 41014#true or 43312#(or (and (= ~a21~0 6) (<= 1 calculate_output_~input) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (<= calculate_output_~input 6)) (and (<= 1 calculate_output_~input) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7) (<= calculate_output_~input 6))) ([#2{~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; calculate_output_~input = [1;6]; }, {~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; calculate_output_~input = [1;6]; }]) 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:32,172 INFO L168 Benchmark]: Toolchain (without parser) took 32638.06 ms. Allocated memory was 138.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 101.7 MB in the beginning and 815.1 MB in the end (delta: -713.4 MB). Peak memory consumption was 770.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:32,172 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:52:32,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.36 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 101.5 MB in the beginning and 165.5 MB in the end (delta: -64.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:32,175 INFO L168 Benchmark]: Boogie Preprocessor took 107.45 ms. Allocated memory is still 205.5 MB. Free memory was 165.5 MB in the beginning and 159.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:32,176 INFO L168 Benchmark]: RCFGBuilder took 1491.05 ms. Allocated memory was 205.5 MB in the beginning and 238.6 MB in the end (delta: 33.0 MB). Free memory was 159.9 MB in the beginning and 154.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:32,179 INFO L168 Benchmark]: TraceAbstraction took 30217.77 ms. Allocated memory was 238.6 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 154.9 MB in the beginning and 815.1 MB in the end (delta: -660.2 MB). Peak memory consumption was 723.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:32,185 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.36 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 101.5 MB in the beginning and 165.5 MB in the end (delta: -64.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.45 ms. Allocated memory is still 205.5 MB. Free memory was 165.5 MB in the beginning and 159.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1491.05 ms. Allocated memory was 205.5 MB in the beginning and 238.6 MB in the end (delta: 33.0 MB). Free memory was 159.9 MB in the beginning and 154.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30217.77 ms. Allocated memory was 238.6 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 154.9 MB in the beginning and 815.1 MB in the end (delta: -660.2 MB). Peak memory consumption was 723.4 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: 41014#true or 43312#(or (and (= ~a21~0 6) (<= 1 calculate_output_~input) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (<= calculate_output_~input 6)) (and (<= 1 calculate_output_~input) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7) (<= calculate_output_~input 6))) ([#2{~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; calculate_output_~input = [1;6]; }, {~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; calculate_output_~input = [1;6]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 41014#true or 43312#(or (and (= ~a21~0 6) (<= 1 calculate_output_~input) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (<= calculate_output_~input 6)) (and (<= 1 calculate_output_~input) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7) (<= calculate_output_~input 6))) ([#2{~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; calculate_output_~input = [1;6]; }, {~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; calculate_output_~input = [1;6]; }]): 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...