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 -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:07:54,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:07:54,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:07:54,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:07:54,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:07:54,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:07:54,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:07:54,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:07:54,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:07:54,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:07:54,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:07:54,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:07:54,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:07:54,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:07:54,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:07:54,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:07:54,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:07:54,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:07:54,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:07:54,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:07:54,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:07:54,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:07:54,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:07:54,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:07:54,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:07:54,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:07:54,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:07:54,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:07:54,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:07:54,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:07:54,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:07:54,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:07:54,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:07:54,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:07:54,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:07:54,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:07:54,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:07:54,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:07:54,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:07:54,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:07:54,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:07:54,470 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-09-07 20:07:54,489 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:07:54,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:07:54,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:07:54,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:07:54,492 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:07:54,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:07:54,492 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:07:54,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:07:54,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:07:54,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:07:54,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:07:54,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:07:54,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:07:54,494 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:07:54,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:07:54,495 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:07:54,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:07:54,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:07:54,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:07:54,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:07:54,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:07:54,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:07:54,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:07:54,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:07:54,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:07:54,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:07:54,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:07:54,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:07:54,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:07:54,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:07:54,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:07:54,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:07:54,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:07:54,581 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:07:54,582 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label11.c [2019-09-07 20:07:54,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97de17a4d/2ddb3306880d48e9a3002c1530a8460c/FLAGea88f124a [2019-09-07 20:07:55,259 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:07:55,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label11.c [2019-09-07 20:07:55,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97de17a4d/2ddb3306880d48e9a3002c1530a8460c/FLAGea88f124a [2019-09-07 20:07:55,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97de17a4d/2ddb3306880d48e9a3002c1530a8460c [2019-09-07 20:07:55,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:07:55,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:07:55,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:07:55,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:07:55,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:07:55,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:07:55" (1/1) ... [2019-09-07 20:07:55,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d26225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:55, skipping insertion in model container [2019-09-07 20:07:55,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:07:55" (1/1) ... [2019-09-07 20:07:55,561 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:07:55,619 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:07:56,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:07:56,168 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:07:56,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:07:56,304 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:07:56,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56 WrapperNode [2019-09-07 20:07:56,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:07:56,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:07:56,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:07:56,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:07:56,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (1/1) ... [2019-09-07 20:07:56,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (1/1) ... [2019-09-07 20:07:56,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (1/1) ... [2019-09-07 20:07:56,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (1/1) ... [2019-09-07 20:07:56,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (1/1) ... [2019-09-07 20:07:56,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (1/1) ... [2019-09-07 20:07:56,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (1/1) ... [2019-09-07 20:07:56,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:07:56,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:07:56,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:07:56,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:07:56,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (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-09-07 20:07:56,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:07:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:07:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:07:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:07:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:07:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:07:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:07:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:07:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:07:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:07:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:07:58,355 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:07:58,356 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:07:58,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:07:58 BoogieIcfgContainer [2019-09-07 20:07:58,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:07:58,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:07:58,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:07:58,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:07:58,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:07:55" (1/3) ... [2019-09-07 20:07:58,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167d6124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:07:58, skipping insertion in model container [2019-09-07 20:07:58,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:07:56" (2/3) ... [2019-09-07 20:07:58,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167d6124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:07:58, skipping insertion in model container [2019-09-07 20:07:58,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:07:58" (3/3) ... [2019-09-07 20:07:58,374 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label11.c [2019-09-07 20:07:58,385 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:07:58,395 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:07:58,412 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:07:58,460 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:07:58,461 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:07:58,462 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:07:58,463 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:07:58,463 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:07:58,463 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:07:58,463 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:07:58,464 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:07:58,464 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:07:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-07 20:07:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 20:07:58,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:58,511 INFO L399 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] [2019-09-07 20:07:58,513 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1178512258, now seen corresponding path program 1 times [2019-09-07 20:07:58,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:58,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:58,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:07:58,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:07:58,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:07:58,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:07:58,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:07:58,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:07:58,868 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-09-07 20:08:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:00,727 INFO L93 Difference]: Finished difference Result 890 states and 1607 transitions. [2019-09-07 20:08:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:08:00,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-07 20:08:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:00,757 INFO L225 Difference]: With dead ends: 890 [2019-09-07 20:08:00,757 INFO L226 Difference]: Without dead ends: 554 [2019-09-07 20:08:00,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:08:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-07 20:08:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-09-07 20:08:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-07 20:08:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 776 transitions. [2019-09-07 20:08:00,875 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 776 transitions. Word has length 27 [2019-09-07 20:08:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:00,875 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 776 transitions. [2019-09-07 20:08:00,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:08:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 776 transitions. [2019-09-07 20:08:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 20:08:00,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:00,884 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:08:00,884 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:00,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1538116754, now seen corresponding path program 1 times [2019-09-07 20:08:00,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:00,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:00,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:08:01,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:08:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:08:01,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:08:01,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:08:01,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:08:01,071 INFO L87 Difference]: Start difference. First operand 554 states and 776 transitions. Second operand 4 states. [2019-09-07 20:08:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:02,434 INFO L93 Difference]: Finished difference Result 2194 states and 3130 transitions. [2019-09-07 20:08:02,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:08:02,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-07 20:08:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:02,451 INFO L225 Difference]: With dead ends: 2194 [2019-09-07 20:08:02,451 INFO L226 Difference]: Without dead ends: 1646 [2019-09-07 20:08:02,454 INFO L628 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-09-07 20:08:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-09-07 20:08:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2019-09-07 20:08:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-09-07 20:08:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2254 transitions. [2019-09-07 20:08:02,545 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2254 transitions. Word has length 139 [2019-09-07 20:08:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:02,551 INFO L475 AbstractCegarLoop]: Abstraction has 1646 states and 2254 transitions. [2019-09-07 20:08:02,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:08:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2254 transitions. [2019-09-07 20:08:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-07 20:08:02,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:02,570 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:08:02,571 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -834018191, now seen corresponding path program 1 times [2019-09-07 20:08:02,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:02,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:02,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 20:08:02,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:08:02,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:08:02,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:08:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:08:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:08:02,895 INFO L87 Difference]: Start difference. First operand 1646 states and 2254 transitions. Second operand 4 states. [2019-09-07 20:08:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:04,516 INFO L93 Difference]: Finished difference Result 5288 states and 7565 transitions. [2019-09-07 20:08:04,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:08:04,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-09-07 20:08:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:04,548 INFO L225 Difference]: With dead ends: 5288 [2019-09-07 20:08:04,548 INFO L226 Difference]: Without dead ends: 3648 [2019-09-07 20:08:04,553 INFO L628 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-09-07 20:08:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-09-07 20:08:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3466. [2019-09-07 20:08:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3466 states. [2019-09-07 20:08:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 4698 transitions. [2019-09-07 20:08:04,697 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 4698 transitions. Word has length 212 [2019-09-07 20:08:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:04,698 INFO L475 AbstractCegarLoop]: Abstraction has 3466 states and 4698 transitions. [2019-09-07 20:08:04,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:08:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 4698 transitions. [2019-09-07 20:08:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-07 20:08:04,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:04,714 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 20:08:04,714 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash -529364795, now seen corresponding path program 1 times [2019-09-07 20:08:04,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:04,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:04,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:04,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:04,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:08:05,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:05,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:05,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:05,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 20:08:05,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:08:05,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:08:05,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:05,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:08:05,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:05,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:08:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:08:05,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:05,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-09-07 20:08:05,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:08:05,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:08:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:08:05,675 INFO L87 Difference]: Start difference. First operand 3466 states and 4698 transitions. Second operand 15 states. [2019-09-07 20:08:05,813 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-07 20:08:06,439 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-07 20:08:06,736 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-07 20:08:06,915 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-07 20:08:07,373 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-07 20:08:08,284 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 20:08:08,520 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-07 20:08:09,295 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-07 20:08:09,753 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-07 20:08:10,552 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-07 20:08:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:11,808 INFO L93 Difference]: Finished difference Result 7944 states and 12401 transitions. [2019-09-07 20:08:11,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 20:08:11,809 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 238 [2019-09-07 20:08:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:11,846 INFO L225 Difference]: With dead ends: 7944 [2019-09-07 20:08:11,846 INFO L226 Difference]: Without dead ends: 4484 [2019-09-07 20:08:11,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 20:08:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2019-09-07 20:08:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 3386. [2019-09-07 20:08:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-09-07 20:08:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4630 transitions. [2019-09-07 20:08:12,097 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4630 transitions. Word has length 238 [2019-09-07 20:08:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:12,097 INFO L475 AbstractCegarLoop]: Abstraction has 3386 states and 4630 transitions. [2019-09-07 20:08:12,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:08:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4630 transitions. [2019-09-07 20:08:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-07 20:08:12,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:12,109 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 20:08:12,109 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash -752271551, now seen corresponding path program 1 times [2019-09-07 20:08:12,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:12,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:12,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:12,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:08:12,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:12,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:12,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:12,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:08:12,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:12,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:08:12,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:08:12,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:08:12,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:08:12,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:08:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:08:12,716 INFO L87 Difference]: Start difference. First operand 3386 states and 4630 transitions. Second operand 8 states. [2019-09-07 20:08:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:15,637 INFO L93 Difference]: Finished difference Result 8110 states and 11378 transitions. [2019-09-07 20:08:15,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:08:15,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2019-09-07 20:08:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:15,662 INFO L225 Difference]: With dead ends: 8110 [2019-09-07 20:08:15,662 INFO L226 Difference]: Without dead ends: 4912 [2019-09-07 20:08:15,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:08:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4912 states. [2019-09-07 20:08:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4912 to 4350. [2019-09-07 20:08:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4350 states. [2019-09-07 20:08:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 5777 transitions. [2019-09-07 20:08:15,791 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 5777 transitions. Word has length 256 [2019-09-07 20:08:15,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:15,791 INFO L475 AbstractCegarLoop]: Abstraction has 4350 states and 5777 transitions. [2019-09-07 20:08:15,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:08:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 5777 transitions. [2019-09-07 20:08:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-07 20:08:15,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:15,803 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:08:15,804 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:15,804 INFO L82 PathProgramCache]: Analyzing trace with hash -416057190, now seen corresponding path program 1 times [2019-09-07 20:08:15,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:15,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:15,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 60 proven. 132 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-07 20:08:16,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:16,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:08:16,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:16,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:08:16,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-07 20:08:16,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:08:16,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:08:16,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:08:16,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:08:16,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:08:16,361 INFO L87 Difference]: Start difference. First operand 4350 states and 5777 transitions. Second operand 8 states. [2019-09-07 20:08:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:17,574 INFO L93 Difference]: Finished difference Result 8418 states and 11785 transitions. [2019-09-07 20:08:17,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:08:17,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 329 [2019-09-07 20:08:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:17,595 INFO L225 Difference]: With dead ends: 8418 [2019-09-07 20:08:17,595 INFO L226 Difference]: Without dead ends: 4258 [2019-09-07 20:08:17,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:08:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4258 states. [2019-09-07 20:08:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4258 to 3984. [2019-09-07 20:08:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3984 states. [2019-09-07 20:08:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4839 transitions. [2019-09-07 20:08:17,718 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4839 transitions. Word has length 329 [2019-09-07 20:08:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:17,718 INFO L475 AbstractCegarLoop]: Abstraction has 3984 states and 4839 transitions. [2019-09-07 20:08:17,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:08:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4839 transitions. [2019-09-07 20:08:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-09-07 20:08:17,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:17,738 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2019-09-07 20:08:17,739 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:17,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1283110047, now seen corresponding path program 1 times [2019-09-07 20:08:17,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:17,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:17,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:17,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:17,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 170 proven. 386 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-07 20:08:18,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:18,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:18,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:19,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 20:08:19,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:19,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 559 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-07 20:08:19,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:19,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-09-07 20:08:19,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:08:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:08:19,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:08:19,434 INFO L87 Difference]: Start difference. First operand 3984 states and 4839 transitions. Second operand 17 states. [2019-09-07 20:08:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:25,994 INFO L93 Difference]: Finished difference Result 9779 states and 12652 transitions. [2019-09-07 20:08:25,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 20:08:25,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 522 [2019-09-07 20:08:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:26,041 INFO L225 Difference]: With dead ends: 9779 [2019-09-07 20:08:26,042 INFO L226 Difference]: Without dead ends: 5646 [2019-09-07 20:08:26,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=598, Invalid=2824, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 20:08:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2019-09-07 20:08:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 5112. [2019-09-07 20:08:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2019-09-07 20:08:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 5867 transitions. [2019-09-07 20:08:26,237 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 5867 transitions. Word has length 522 [2019-09-07 20:08:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:26,237 INFO L475 AbstractCegarLoop]: Abstraction has 5112 states and 5867 transitions. [2019-09-07 20:08:26,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:08:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 5867 transitions. [2019-09-07 20:08:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-09-07 20:08:26,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:26,260 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:08:26,260 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash 226513190, now seen corresponding path program 1 times [2019-09-07 20:08:26,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:26,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:26,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 195 proven. 256 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-09-07 20:08:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:26,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:08:26,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:27,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:08:27,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 611 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:08:27,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:27,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:08:27,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:08:27,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:08:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:08:27,290 INFO L87 Difference]: Start difference. First operand 5112 states and 5867 transitions. Second operand 9 states. [2019-09-07 20:08:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:29,942 INFO L93 Difference]: Finished difference Result 11550 states and 13973 transitions. [2019-09-07 20:08:29,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:08:29,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 573 [2019-09-07 20:08:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:29,966 INFO L225 Difference]: With dead ends: 11550 [2019-09-07 20:08:29,966 INFO L226 Difference]: Without dead ends: 6628 [2019-09-07 20:08:29,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:08:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6628 states. [2019-09-07 20:08:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6628 to 6586. [2019-09-07 20:08:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6586 states. [2019-09-07 20:08:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 7934 transitions. [2019-09-07 20:08:30,140 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 7934 transitions. Word has length 573 [2019-09-07 20:08:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:30,140 INFO L475 AbstractCegarLoop]: Abstraction has 6586 states and 7934 transitions. [2019-09-07 20:08:30,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:08:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 7934 transitions. [2019-09-07 20:08:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2019-09-07 20:08:30,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:30,172 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:08:30,173 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash 328064190, now seen corresponding path program 1 times [2019-09-07 20:08:30,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:30,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:30,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:30,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:30,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 451 proven. 274 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-09-07 20:08:30,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:30,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:30,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:31,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:08:31,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 1246 proven. 2 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-09-07 20:08:31,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:31,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 20:08:31,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:08:31,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:08:31,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:08:31,747 INFO L87 Difference]: Start difference. First operand 6586 states and 7934 transitions. Second operand 10 states. [2019-09-07 20:08:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:34,119 INFO L93 Difference]: Finished difference Result 15564 states and 18164 transitions. [2019-09-07 20:08:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:08:34,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 785 [2019-09-07 20:08:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:34,143 INFO L225 Difference]: With dead ends: 15564 [2019-09-07 20:08:34,143 INFO L226 Difference]: Without dead ends: 7670 [2019-09-07 20:08:34,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 791 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:08:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2019-09-07 20:08:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 7110. [2019-09-07 20:08:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7110 states. [2019-09-07 20:08:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 7778 transitions. [2019-09-07 20:08:34,368 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 7778 transitions. Word has length 785 [2019-09-07 20:08:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:34,369 INFO L475 AbstractCegarLoop]: Abstraction has 7110 states and 7778 transitions. [2019-09-07 20:08:34,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:08:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 7778 transitions. [2019-09-07 20:08:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2019-09-07 20:08:34,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:34,407 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:08:34,407 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -101004111, now seen corresponding path program 1 times [2019-09-07 20:08:34,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:34,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:34,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 638 proven. 99 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2019-09-07 20:08:35,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:35,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:35,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:08:35,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 1096 proven. 2 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 20:08:35,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:35,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:08:35,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:08:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:08:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:08:35,887 INFO L87 Difference]: Start difference. First operand 7110 states and 7778 transitions. Second operand 7 states. [2019-09-07 20:08:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:36,970 INFO L93 Difference]: Finished difference Result 14962 states and 16441 transitions. [2019-09-07 20:08:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:08:36,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 800 [2019-09-07 20:08:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:36,990 INFO L225 Difference]: With dead ends: 14962 [2019-09-07 20:08:36,990 INFO L226 Difference]: Without dead ends: 8224 [2019-09-07 20:08:37,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:08:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8224 states. [2019-09-07 20:08:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8224 to 7486. [2019-09-07 20:08:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7486 states. [2019-09-07 20:08:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7486 states to 7486 states and 8217 transitions. [2019-09-07 20:08:37,115 INFO L78 Accepts]: Start accepts. Automaton has 7486 states and 8217 transitions. Word has length 800 [2019-09-07 20:08:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:37,117 INFO L475 AbstractCegarLoop]: Abstraction has 7486 states and 8217 transitions. [2019-09-07 20:08:37,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:08:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7486 states and 8217 transitions. [2019-09-07 20:08:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2019-09-07 20:08:37,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:37,137 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:08:37,137 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash 238150457, now seen corresponding path program 1 times [2019-09-07 20:08:37,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:37,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:37,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:37,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:37,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 483 proven. 150 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-07 20:08:37,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:37,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:37,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:38,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:08:38,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1452 proven. 2 refuted. 0 times theorem prover too weak. 796 trivial. 0 not checked. [2019-09-07 20:08:38,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:38,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 20:08:38,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:08:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:08:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:08:38,595 INFO L87 Difference]: Start difference. First operand 7486 states and 8217 transitions. Second operand 10 states. [2019-09-07 20:08:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:40,610 INFO L93 Difference]: Finished difference Result 14592 states and 16055 transitions. [2019-09-07 20:08:40,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:08:40,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 876 [2019-09-07 20:08:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:40,630 INFO L225 Difference]: With dead ends: 14592 [2019-09-07 20:08:40,630 INFO L226 Difference]: Without dead ends: 6922 [2019-09-07 20:08:40,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 885 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:08:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2019-09-07 20:08:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6730. [2019-09-07 20:08:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6730 states. [2019-09-07 20:08:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 7190 transitions. [2019-09-07 20:08:40,740 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 7190 transitions. Word has length 876 [2019-09-07 20:08:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:40,741 INFO L475 AbstractCegarLoop]: Abstraction has 6730 states and 7190 transitions. [2019-09-07 20:08:40,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:08:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 7190 transitions. [2019-09-07 20:08:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-09-07 20:08:40,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:40,761 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-09-07 20:08:40,762 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:40,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1679509390, now seen corresponding path program 1 times [2019-09-07 20:08:40,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:40,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:40,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:40,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:40,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:41,505 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-07 20:08:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 513 proven. 1104 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-09-07 20:08:43,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:43,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:43,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:08:43,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:43,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:08:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 1616 proven. 2 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2019-09-07 20:08:44,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:44,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2019-09-07 20:08:44,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:08:44,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:08:44,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:08:44,597 INFO L87 Difference]: Start difference. First operand 6730 states and 7190 transitions. Second operand 18 states. [2019-09-07 20:08:46,768 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-07 20:08:47,581 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-07 20:08:47,800 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-07 20:08:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:49,231 INFO L93 Difference]: Finished difference Result 13502 states and 14509 transitions. [2019-09-07 20:08:49,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 20:08:49,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 887 [2019-09-07 20:08:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:49,249 INFO L225 Difference]: With dead ends: 13502 [2019-09-07 20:08:49,249 INFO L226 Difference]: Without dead ends: 7144 [2019-09-07 20:08:49,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 900 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=1162, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 20:08:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7144 states. [2019-09-07 20:08:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7144 to 7094. [2019-09-07 20:08:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7094 states. [2019-09-07 20:08:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7094 states to 7094 states and 7542 transitions. [2019-09-07 20:08:49,363 INFO L78 Accepts]: Start accepts. Automaton has 7094 states and 7542 transitions. Word has length 887 [2019-09-07 20:08:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:49,364 INFO L475 AbstractCegarLoop]: Abstraction has 7094 states and 7542 transitions. [2019-09-07 20:08:49,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:08:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7094 states and 7542 transitions. [2019-09-07 20:08:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2019-09-07 20:08:49,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:49,390 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:08:49,390 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:49,391 INFO L82 PathProgramCache]: Analyzing trace with hash 4641222, now seen corresponding path program 1 times [2019-09-07 20:08:49,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:49,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:49,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:49,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 1625 proven. 171 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2019-09-07 20:08:50,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:50,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:50,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:50,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:08:50,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:50,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:50,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 1398 proven. 6 refuted. 0 times theorem prover too weak. 1446 trivial. 0 not checked. [2019-09-07 20:08:51,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:51,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-09-07 20:08:51,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:08:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:08:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:08:51,645 INFO L87 Difference]: Start difference. First operand 7094 states and 7542 transitions. Second operand 14 states. [2019-09-07 20:08:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:54,973 INFO L93 Difference]: Finished difference Result 14242 states and 15208 transitions. [2019-09-07 20:08:54,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:08:54,974 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 975 [2019-09-07 20:08:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:54,990 INFO L225 Difference]: With dead ends: 14242 [2019-09-07 20:08:54,991 INFO L226 Difference]: Without dead ends: 7520 [2019-09-07 20:08:54,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 986 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:08:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7520 states. [2019-09-07 20:08:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7520 to 6898. [2019-09-07 20:08:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6898 states. [2019-09-07 20:08:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6898 states to 6898 states and 7297 transitions. [2019-09-07 20:08:55,119 INFO L78 Accepts]: Start accepts. Automaton has 6898 states and 7297 transitions. Word has length 975 [2019-09-07 20:08:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:55,120 INFO L475 AbstractCegarLoop]: Abstraction has 6898 states and 7297 transitions. [2019-09-07 20:08:55,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:08:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6898 states and 7297 transitions. [2019-09-07 20:08:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1529 [2019-09-07 20:08:55,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:55,163 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 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, 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] [2019-09-07 20:08:55,164 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1850012245, now seen corresponding path program 1 times [2019-09-07 20:08:55,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:55,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:55,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:55,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 20:08:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 20:08:55,776 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Int term has non-integral value at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:66) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:745) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:108) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1090) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.getValues(SmtUtils.java:1813) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getValue(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) 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-09-07 20:08:55,789 INFO L168 Benchmark]: Toolchain (without parser) took 60239.16 ms. Allocated memory was 133.7 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 87.9 MB in the beginning and 305.0 MB in the end (delta: -217.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-07 20:08:55,790 INFO L168 Benchmark]: CDTParser took 2.48 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-07 20:08:55,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.10 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 87.7 MB in the beginning and 150.5 MB in the end (delta: -62.8 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2019-09-07 20:08:55,792 INFO L168 Benchmark]: Boogie Preprocessor took 178.85 ms. Allocated memory is still 200.8 MB. Free memory was 150.5 MB in the beginning and 144.8 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2019-09-07 20:08:55,794 INFO L168 Benchmark]: RCFGBuilder took 1879.78 ms. Allocated memory was 200.8 MB in the beginning and 226.5 MB in the end (delta: 25.7 MB). Free memory was 144.8 MB in the beginning and 140.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 74.9 MB. Max. memory is 7.1 GB. [2019-09-07 20:08:55,797 INFO L168 Benchmark]: TraceAbstraction took 57416.74 ms. Allocated memory was 226.5 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 140.2 MB in the beginning and 305.0 MB in the end (delta: -164.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-09-07 20:08:55,806 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.48 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.10 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 87.7 MB in the beginning and 150.5 MB in the end (delta: -62.8 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 178.85 ms. Allocated memory is still 200.8 MB. Free memory was 150.5 MB in the beginning and 144.8 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1879.78 ms. Allocated memory was 200.8 MB in the beginning and 226.5 MB in the end (delta: 25.7 MB). Free memory was 144.8 MB in the beginning and 140.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 74.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57416.74 ms. Allocated memory was 226.5 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 140.2 MB in the beginning and 305.0 MB in the end (delta: -164.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Int term has non-integral value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Int term has non-integral value: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...