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/Problem17_label37.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:52:21,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:52:21,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:52:21,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:52:21,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:52:21,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:52:21,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:52:21,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:52:21,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:52:21,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:52:21,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:52:21,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:52:21,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:52:21,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:52:21,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:52:21,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:52:21,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:52:21,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:52:21,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:52:21,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:52:21,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:52:21,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:52:21,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:52:21,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:52:21,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:52:21,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:52:21,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:52:21,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:52:21,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:52:21,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:52:21,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:52:21,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:52:21,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:52:21,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:52:21,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:52:21,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:52:21,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:52:21,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:52:21,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:52:21,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:52:21,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:52:21,844 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 21:52:21,859 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:52:21,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:52:21,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:52:21,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:52:21,861 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:52:21,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:52:21,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:52:21,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:52:21,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:52:21,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:52:21,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:52:21,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:52:21,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:52:21,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:52:21,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:52:21,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:52:21,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:52:21,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:52:21,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:52:21,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:52:21,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:52:21,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:52:21,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:52:21,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:52:21,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:52:21,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:52:21,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:52:21,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:52:21,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:52:21,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:52:21,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:52:21,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:52:21,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:52:21,930 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:52:21,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label37.c [2019-09-07 21:52:22,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb57648d/65a6547ccde943548e328b1df103fe95/FLAGb7701c902 [2019-09-07 21:52:22,821 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:52:22,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label37.c [2019-09-07 21:52:22,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb57648d/65a6547ccde943548e328b1df103fe95/FLAGb7701c902 [2019-09-07 21:52:23,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb57648d/65a6547ccde943548e328b1df103fe95 [2019-09-07 21:52:23,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:52:23,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:52:23,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:52:23,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:52:23,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:52:23,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:52:23" (1/1) ... [2019-09-07 21:52:23,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91b275c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:23, skipping insertion in model container [2019-09-07 21:52:23,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:52:23" (1/1) ... [2019-09-07 21:52:23,368 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:52:23,481 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:52:24,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:52:24,772 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:52:25,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:52:25,240 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:52:25,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25 WrapperNode [2019-09-07 21:52:25,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:52:25,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:52:25,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:52:25,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:52:25,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (1/1) ... [2019-09-07 21:52:25,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (1/1) ... [2019-09-07 21:52:25,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (1/1) ... [2019-09-07 21:52:25,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (1/1) ... [2019-09-07 21:52:25,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (1/1) ... [2019-09-07 21:52:25,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (1/1) ... [2019-09-07 21:52:25,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (1/1) ... [2019-09-07 21:52:25,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:52:25,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:52:25,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:52:25,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:52:25,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (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 21:52:25,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:52:25,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:52:25,659 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:52:25,660 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:52:25,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:52:25,660 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:52:25,661 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:52:25,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:52:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:52:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:52:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:52:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:52:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:52:30,073 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:52:30,073 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:52:30,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:52:30 BoogieIcfgContainer [2019-09-07 21:52:30,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:52:30,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:52:30,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:52:30,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:52:30,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:52:23" (1/3) ... [2019-09-07 21:52:30,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2023d05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:52:30, skipping insertion in model container [2019-09-07 21:52:30,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:52:25" (2/3) ... [2019-09-07 21:52:30,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2023d05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:52:30, skipping insertion in model container [2019-09-07 21:52:30,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:52:30" (3/3) ... [2019-09-07 21:52:30,084 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label37.c [2019-09-07 21:52:30,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:52:30,104 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:52:30,122 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:52:30,163 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:52:30,164 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:52:30,165 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:52:30,165 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:52:30,165 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:52:30,165 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:52:30,165 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:52:30,166 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:52:30,166 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:52:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:52:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 21:52:30,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:52:30,216 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] [2019-09-07 21:52:30,218 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:52:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:52:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash -436715231, now seen corresponding path program 1 times [2019-09-07 21:52:30,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:52:30,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:52:30,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:30,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:52:30,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:52:30,627 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 21:52:30,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:52:30,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:52:30,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:52:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:52:30,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:52:30,657 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:52:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:52:38,112 INFO L93 Difference]: Finished difference Result 2133 states and 3962 transitions. [2019-09-07 21:52:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:52:38,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-07 21:52:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:52:38,148 INFO L225 Difference]: With dead ends: 2133 [2019-09-07 21:52:38,149 INFO L226 Difference]: Without dead ends: 1451 [2019-09-07 21:52:38,160 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 21:52:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-09-07 21:52:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1437. [2019-09-07 21:52:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2019-09-07 21:52:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2166 transitions. [2019-09-07 21:52:38,293 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2166 transitions. Word has length 24 [2019-09-07 21:52:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:52:38,294 INFO L475 AbstractCegarLoop]: Abstraction has 1437 states and 2166 transitions. [2019-09-07 21:52:38,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:52:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2166 transitions. [2019-09-07 21:52:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 21:52:38,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:52:38,300 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 21:52:38,300 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:52:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:52:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1842436940, now seen corresponding path program 1 times [2019-09-07 21:52:38,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:52:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:52:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:38,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:52:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:52:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:52:38,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:52:38,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:52:38,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:52:38,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:52:38,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:52:38,571 INFO L87 Difference]: Start difference. First operand 1437 states and 2166 transitions. Second operand 5 states. [2019-09-07 21:52:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:52:44,347 INFO L93 Difference]: Finished difference Result 4255 states and 6536 transitions. [2019-09-07 21:52:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:52:44,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-07 21:52:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:52:44,368 INFO L225 Difference]: With dead ends: 4255 [2019-09-07 21:52:44,368 INFO L226 Difference]: Without dead ends: 2824 [2019-09-07 21:52:44,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:52:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2019-09-07 21:52:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2794. [2019-09-07 21:52:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2019-09-07 21:52:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 3921 transitions. [2019-09-07 21:52:44,481 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 3921 transitions. Word has length 95 [2019-09-07 21:52:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:52:44,482 INFO L475 AbstractCegarLoop]: Abstraction has 2794 states and 3921 transitions. [2019-09-07 21:52:44,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:52:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3921 transitions. [2019-09-07 21:52:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 21:52:44,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:52:44,486 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 21:52:44,487 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:52:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:52:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash 786610840, now seen corresponding path program 1 times [2019-09-07 21:52:44,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:52:44,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:52:44,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:44,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:52:44,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:52:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:52:44,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:52:44,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:52:44,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:52:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:52:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:52:44,666 INFO L87 Difference]: Start difference. First operand 2794 states and 3921 transitions. Second operand 3 states. [2019-09-07 21:52:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:52:48,394 INFO L93 Difference]: Finished difference Result 6471 states and 9371 transitions. [2019-09-07 21:52:48,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:52:48,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-07 21:52:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:52:48,421 INFO L225 Difference]: With dead ends: 6471 [2019-09-07 21:52:48,421 INFO L226 Difference]: Without dead ends: 3683 [2019-09-07 21:52:48,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:52:48,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2019-09-07 21:52:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3681. [2019-09-07 21:52:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3681 states. [2019-09-07 21:52:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 5053 transitions. [2019-09-07 21:52:48,539 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 5053 transitions. Word has length 98 [2019-09-07 21:52:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:52:48,548 INFO L475 AbstractCegarLoop]: Abstraction has 3681 states and 5053 transitions. [2019-09-07 21:52:48,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:52:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 5053 transitions. [2019-09-07 21:52:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-07 21:52:48,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:52:48,558 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:52:48,559 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:52:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:52:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1574468089, now seen corresponding path program 1 times [2019-09-07 21:52:48,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:52:48,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:52:48,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:48,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:52:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:52:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:52:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:52:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:52:48,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:52:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:52:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:52:48,821 INFO L87 Difference]: Start difference. First operand 3681 states and 5053 transitions. Second operand 6 states. [2019-09-07 21:52:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:52:55,267 INFO L93 Difference]: Finished difference Result 9640 states and 13295 transitions. [2019-09-07 21:52:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:52:55,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-07 21:52:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:52:55,301 INFO L225 Difference]: With dead ends: 9640 [2019-09-07 21:52:55,301 INFO L226 Difference]: Without dead ends: 5965 [2019-09-07 21:52:55,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:52:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2019-09-07 21:52:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 5492. [2019-09-07 21:52:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5492 states. [2019-09-07 21:52:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 6769 transitions. [2019-09-07 21:52:55,459 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 6769 transitions. Word has length 178 [2019-09-07 21:52:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:52:55,463 INFO L475 AbstractCegarLoop]: Abstraction has 5492 states and 6769 transitions. [2019-09-07 21:52:55,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:52:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 6769 transitions. [2019-09-07 21:52:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 21:52:55,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:52:55,470 INFO L399 BasicCegarLoop]: trace histogram [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, 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 21:52:55,470 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:52:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:52:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash -857711399, now seen corresponding path program 1 times [2019-09-07 21:52:55,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:52:55,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:52:55,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:55,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:52:55,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:52:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 21:52:55,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:52:55,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:52:55,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:52:55,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:52:55,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:52:55,621 INFO L87 Difference]: Start difference. First operand 5492 states and 6769 transitions. Second operand 3 states. [2019-09-07 21:52:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:52:59,299 INFO L93 Difference]: Finished difference Result 14941 states and 18612 transitions. [2019-09-07 21:52:59,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:52:59,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-07 21:52:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:52:59,338 INFO L225 Difference]: With dead ends: 14941 [2019-09-07 21:52:59,338 INFO L226 Difference]: Without dead ends: 9455 [2019-09-07 21:52:59,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:52:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9455 states. [2019-09-07 21:52:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9455 to 9022. [2019-09-07 21:52:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9022 states. [2019-09-07 21:52:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9022 states to 9022 states and 10765 transitions. [2019-09-07 21:52:59,561 INFO L78 Accepts]: Start accepts. Automaton has 9022 states and 10765 transitions. Word has length 186 [2019-09-07 21:52:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:52:59,562 INFO L475 AbstractCegarLoop]: Abstraction has 9022 states and 10765 transitions. [2019-09-07 21:52:59,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:52:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9022 states and 10765 transitions. [2019-09-07 21:52:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-07 21:52:59,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:52:59,566 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:52:59,567 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:52:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:52:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1315014228, now seen corresponding path program 1 times [2019-09-07 21:52:59,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:52:59,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:52:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:59,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:52:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:52:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:52:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 21:52:59,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:52:59,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:52:59,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:52:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:52:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:52:59,747 INFO L87 Difference]: Start difference. First operand 9022 states and 10765 transitions. Second operand 4 states. [2019-09-07 21:53:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:53:05,393 INFO L93 Difference]: Finished difference Result 27292 states and 33621 transitions. [2019-09-07 21:53:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:53:05,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-09-07 21:53:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:53:05,457 INFO L225 Difference]: With dead ends: 27292 [2019-09-07 21:53:05,458 INFO L226 Difference]: Without dead ends: 18276 [2019-09-07 21:53:05,476 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 21:53:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-09-07 21:53:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 16541. [2019-09-07 21:53:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16541 states. [2019-09-07 21:53:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16541 states to 16541 states and 19512 transitions. [2019-09-07 21:53:05,795 INFO L78 Accepts]: Start accepts. Automaton has 16541 states and 19512 transitions. Word has length 204 [2019-09-07 21:53:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:53:05,797 INFO L475 AbstractCegarLoop]: Abstraction has 16541 states and 19512 transitions. [2019-09-07 21:53:05,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:53:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 16541 states and 19512 transitions. [2019-09-07 21:53:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-07 21:53:05,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:53:05,801 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:05,802 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:53:05,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:53:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash 374334210, now seen corresponding path program 1 times [2019-09-07 21:53:05,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:53:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:53:05,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:53:05,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:53:05,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:53:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:53:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 30 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:53:06,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:53:06,028 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) [2019-09-07 21:53:06,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:53:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:53:06,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:53:06,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:53:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 21:53:06,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:53:06,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 21:53:06,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:53:06,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:53:06,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:53:06,298 INFO L87 Difference]: Start difference. First operand 16541 states and 19512 transitions. Second operand 9 states. [2019-09-07 21:53:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:53:14,992 INFO L93 Difference]: Finished difference Result 34547 states and 41335 transitions. [2019-09-07 21:53:14,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 21:53:14,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-09-07 21:53:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:53:15,085 INFO L225 Difference]: With dead ends: 34547 [2019-09-07 21:53:15,085 INFO L226 Difference]: Without dead ends: 17153 [2019-09-07 21:53:15,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:53:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17153 states. [2019-09-07 21:53:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17153 to 16277. [2019-09-07 21:53:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16277 states. [2019-09-07 21:53:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16277 states to 16277 states and 19789 transitions. [2019-09-07 21:53:15,587 INFO L78 Accepts]: Start accepts. Automaton has 16277 states and 19789 transitions. Word has length 207 [2019-09-07 21:53:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:53:15,587 INFO L475 AbstractCegarLoop]: Abstraction has 16277 states and 19789 transitions. [2019-09-07 21:53:15,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:53:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 16277 states and 19789 transitions. [2019-09-07 21:53:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-07 21:53:15,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:53:15,607 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:15,607 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:53:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:53:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -826853047, now seen corresponding path program 1 times [2019-09-07 21:53:15,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:53:15,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:53:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:53:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:53:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:53:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:53:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:53:16,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:53:16,165 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) [2019-09-07 21:53:16,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:53:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:53:16,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:53:16,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:53:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 21:53:16,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:53:16,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-07 21:53:16,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:53:16,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:53:16,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:53:16,717 INFO L87 Difference]: Start difference. First operand 16277 states and 19789 transitions. Second operand 11 states. [2019-09-07 21:53:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:53:47,232 INFO L93 Difference]: Finished difference Result 67194 states and 85753 transitions. [2019-09-07 21:53:47,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 21:53:47,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 371 [2019-09-07 21:53:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:53:47,480 INFO L225 Difference]: With dead ends: 67194 [2019-09-07 21:53:47,480 INFO L226 Difference]: Without dead ends: 49619 [2019-09-07 21:53:47,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=603, Invalid=2589, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 21:53:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49619 states. [2019-09-07 21:53:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49619 to 41142. [2019-09-07 21:53:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41142 states. [2019-09-07 21:53:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41142 states to 41142 states and 52322 transitions. [2019-09-07 21:53:48,756 INFO L78 Accepts]: Start accepts. Automaton has 41142 states and 52322 transitions. Word has length 371 [2019-09-07 21:53:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:53:48,757 INFO L475 AbstractCegarLoop]: Abstraction has 41142 states and 52322 transitions. [2019-09-07 21:53:48,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:53:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 41142 states and 52322 transitions. [2019-09-07 21:53:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-09-07 21:53:48,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:53:48,806 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:48,806 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:53:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:53:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -434060726, now seen corresponding path program 1 times [2019-09-07 21:53:48,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:53:48,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:53:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:53:48,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:53:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:53:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:53:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 53 proven. 194 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-07 21:53:49,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:53:49,541 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:53:49,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:53:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:53:49,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 21:53:49,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:53:49,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:53:49,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:53:49,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:53:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 21:53:50,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:53:50,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 21:53:50,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:53:50,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:53:50,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:53:50,401 INFO L87 Difference]: Start difference. First operand 41142 states and 52322 transitions. Second operand 16 states. [2019-09-07 21:54:07,840 WARN L188 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2019-09-07 21:54:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:54:42,077 INFO L93 Difference]: Finished difference Result 153157 states and 246152 transitions. [2019-09-07 21:54:42,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-07 21:54:42,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 471 [2019-09-07 21:54:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:54:42,919 INFO L225 Difference]: With dead ends: 153157 [2019-09-07 21:54:42,919 INFO L226 Difference]: Without dead ends: 107755 [2019-09-07 21:54:43,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4210 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1462, Invalid=9880, Unknown=0, NotChecked=0, Total=11342 [2019-09-07 21:54:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107755 states. [2019-09-07 21:54:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107755 to 100969. [2019-09-07 21:54:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100969 states. [2019-09-07 21:54:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100969 states to 100969 states and 136340 transitions. [2019-09-07 21:54:47,067 INFO L78 Accepts]: Start accepts. Automaton has 100969 states and 136340 transitions. Word has length 471 [2019-09-07 21:54:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:54:47,067 INFO L475 AbstractCegarLoop]: Abstraction has 100969 states and 136340 transitions. [2019-09-07 21:54:47,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 21:54:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 100969 states and 136340 transitions. [2019-09-07 21:54:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-09-07 21:54:47,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:54:47,129 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:47,129 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:54:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:54:47,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1677056711, now seen corresponding path program 1 times [2019-09-07 21:54:47,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:54:47,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:54:47,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:54:47,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:54:47,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:54:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:54:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 21:54:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:54:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:54:49,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:54:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:54:49,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:54:49,371 INFO L87 Difference]: Start difference. First operand 100969 states and 136340 transitions. Second operand 3 states. [2019-09-07 21:54:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:54:54,262 INFO L93 Difference]: Finished difference Result 204953 states and 278405 transitions. [2019-09-07 21:54:54,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:54:54,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 566 [2019-09-07 21:54:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:54:54,608 INFO L225 Difference]: With dead ends: 204953 [2019-09-07 21:54:54,609 INFO L226 Difference]: Without dead ends: 103900 [2019-09-07 21:54:54,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:54:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103900 states. [2019-09-07 21:54:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103900 to 103892. [2019-09-07 21:54:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103892 states. [2019-09-07 21:54:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103892 states to 103892 states and 137460 transitions. [2019-09-07 21:54:56,921 INFO L78 Accepts]: Start accepts. Automaton has 103892 states and 137460 transitions. Word has length 566 [2019-09-07 21:54:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:54:56,922 INFO L475 AbstractCegarLoop]: Abstraction has 103892 states and 137460 transitions. [2019-09-07 21:54:56,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:54:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 103892 states and 137460 transitions. [2019-09-07 21:54:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-09-07 21:54:56,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:54:56,954 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:56,954 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:54:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:54:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash 15596330, now seen corresponding path program 1 times [2019-09-07 21:54:56,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:54:56,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:54:56,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:54:56,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:54:56,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:54:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:54:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 17 proven. 85 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2019-09-07 21:54:57,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:54:57,702 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 21:54:57,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:54:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:54:58,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:54:58,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:54:58,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:54:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 21:54:58,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:54:58,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-07 21:54:58,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 21:54:58,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 21:54:58,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:54:58,684 INFO L87 Difference]: Start difference. First operand 103892 states and 137460 transitions. Second operand 15 states. [2019-09-07 21:55:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:55:39,606 INFO L93 Difference]: Finished difference Result 270286 states and 344796 transitions. [2019-09-07 21:55:39,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-07 21:55:39,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 569 [2019-09-07 21:55:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:55:40,012 INFO L225 Difference]: With dead ends: 270286 [2019-09-07 21:55:40,012 INFO L226 Difference]: Without dead ends: 166796 [2019-09-07 21:55:40,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3998 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1771, Invalid=8941, Unknown=0, NotChecked=0, Total=10712 [2019-09-07 21:55:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166796 states. [2019-09-07 21:55:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166796 to 158830. [2019-09-07 21:55:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158830 states. [2019-09-07 21:55:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158830 states to 158830 states and 193207 transitions. [2019-09-07 21:55:42,924 INFO L78 Accepts]: Start accepts. Automaton has 158830 states and 193207 transitions. Word has length 569 [2019-09-07 21:55:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:55:42,924 INFO L475 AbstractCegarLoop]: Abstraction has 158830 states and 193207 transitions. [2019-09-07 21:55:42,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 21:55:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 158830 states and 193207 transitions. [2019-09-07 21:55:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-09-07 21:55:42,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:55:42,954 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:55:42,954 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:55:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:55:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1865256709, now seen corresponding path program 1 times [2019-09-07 21:55:42,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:55:42,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:55:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:55:42,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:55:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:55:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:55:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 576 proven. 10 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-09-07 21:55:43,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:55:43,585 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:55:43,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:55:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:55:43,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:55:43,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:55:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:52,820 WARN L188 SmtUtils]: Spent 8.75 s on a formula simplification. DAG size of input: 162 DAG size of output: 45 [2019-09-07 21:55:52,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:55:54,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:55:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 722 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:55:57,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:55:57,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 21:55:57,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 21:55:57,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 21:55:57,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=129, Unknown=1, NotChecked=0, Total=156 [2019-09-07 21:55:57,673 INFO L87 Difference]: Start difference. First operand 158830 states and 193207 transitions. Second operand 13 states. [2019-09-07 21:56:03,079 WARN L188 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2019-09-07 21:56:12,682 WARN L188 SmtUtils]: Spent 4.80 s on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2019-09-07 21:56:18,204 WARN L188 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-09-07 21:56:26,665 WARN L188 SmtUtils]: Spent 7.87 s on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-07 21:56:37,174 WARN L188 SmtUtils]: Spent 10.25 s on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-07 21:56:45,591 WARN L188 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2019-09-07 21:56:53,618 WARN L188 SmtUtils]: Spent 7.72 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-07 21:57:06,038 WARN L188 SmtUtils]: Spent 12.00 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-07 21:57:11,454 WARN L188 SmtUtils]: Spent 5.07 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-07 21:57:17,586 WARN L188 SmtUtils]: Spent 5.43 s on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-09-07 21:57:23,700 WARN L188 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2019-09-07 21:57:29,627 WARN L188 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2019-09-07 21:57:34,001 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-07 21:57:39,697 WARN L188 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-09-07 21:57:45,464 WARN L188 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-07 21:57:51,701 WARN L188 SmtUtils]: Spent 5.52 s on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-09-07 21:57:58,780 WARN L188 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 57 DAG size of output: 13 [2019-09-07 21:58:09,131 WARN L188 SmtUtils]: Spent 9.87 s on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-07 21:58:14,618 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-09-07 21:58:42,279 WARN L188 SmtUtils]: Spent 7.81 s on a formula simplification. DAG size of input: 55 DAG size of output: 23 [2019-09-07 21:58:49,486 WARN L188 SmtUtils]: Spent 5.37 s on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-07 21:58:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:58:50,227 INFO L93 Difference]: Finished difference Result 389295 states and 474372 transitions. [2019-09-07 21:58:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-07 21:58:50,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 697 [2019-09-07 21:58:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:58:50,814 INFO L225 Difference]: With dead ends: 389295 [2019-09-07 21:58:50,814 INFO L226 Difference]: Without dead ends: 227377 [2019-09-07 21:58:51,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 769 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3372 ImplicationChecksByTransitivity, 149.1s TimeCoverageRelationStatistics Valid=1162, Invalid=7956, Unknown=2, NotChecked=0, Total=9120 [2019-09-07 21:58:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227377 states. [2019-09-07 21:58:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227377 to 210265. [2019-09-07 21:58:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210265 states. [2019-09-07 21:58:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210265 states to 210265 states and 248843 transitions. [2019-09-07 21:58:59,931 INFO L78 Accepts]: Start accepts. Automaton has 210265 states and 248843 transitions. Word has length 697 [2019-09-07 21:58:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:58:59,932 INFO L475 AbstractCegarLoop]: Abstraction has 210265 states and 248843 transitions. [2019-09-07 21:58:59,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 21:58:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 210265 states and 248843 transitions. [2019-09-07 21:58:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-09-07 21:58:59,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:58:59,956 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:58:59,957 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:58:59,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:58:59,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1141808024, now seen corresponding path program 1 times [2019-09-07 21:58:59,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:58:59,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:58:59,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:59,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:58:59,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 476 proven. 16 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 21:59:00,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:59:00,649 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) [2019-09-07 21:59:00,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:59:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:00,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:59:00,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:59:00,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:59:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 476 proven. 16 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 21:59:01,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:59:01,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 21:59:01,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:59:01,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:59:01,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:59:01,191 INFO L87 Difference]: Start difference. First operand 210265 states and 248843 transitions. Second operand 8 states. [2019-09-07 21:59:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:59:13,070 INFO L93 Difference]: Finished difference Result 481104 states and 572701 transitions. [2019-09-07 21:59:13,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:59:13,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 701 [2019-09-07 21:59:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:59:14,427 INFO L225 Difference]: With dead ends: 481104 [2019-09-07 21:59:14,427 INFO L226 Difference]: Without dead ends: 275701 [2019-09-07 21:59:14,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 708 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:59:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275701 states. [2019-09-07 21:59:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275701 to 253411. [2019-09-07 21:59:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253411 states. [2019-09-07 21:59:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253411 states to 253411 states and 301199 transitions. [2019-09-07 21:59:22,432 INFO L78 Accepts]: Start accepts. Automaton has 253411 states and 301199 transitions. Word has length 701 [2019-09-07 21:59:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:59:22,433 INFO L475 AbstractCegarLoop]: Abstraction has 253411 states and 301199 transitions. [2019-09-07 21:59:22,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:59:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 253411 states and 301199 transitions. [2019-09-07 21:59:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2019-09-07 21:59:22,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:59:22,474 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:59:22,474 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:59:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:59:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash 697023181, now seen corresponding path program 1 times [2019-09-07 21:59:22,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:59:22,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:59:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 548 proven. 2 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2019-09-07 21:59:23,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:59:23,788 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 21:59:23,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:24,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:59:24,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:59:24,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:59:24,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:59:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 548 proven. 2 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:59:25,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:59:25,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-07 21:59:25,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:59:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:59:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:59:25,021 INFO L87 Difference]: Start difference. First operand 253411 states and 301199 transitions. Second operand 11 states. [2019-09-07 22:00:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:00:21,949 INFO L93 Difference]: Finished difference Result 489821 states and 585307 transitions. [2019-09-07 22:00:21,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-07 22:00:21,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 733 [2019-09-07 22:00:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:00:22,503 INFO L225 Difference]: With dead ends: 489821 [2019-09-07 22:00:22,503 INFO L226 Difference]: Without dead ends: 241707 [2019-09-07 22:00:22,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 793 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=862, Invalid=5458, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 22:00:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241707 states. [2019-09-07 22:00:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241707 to 218464. [2019-09-07 22:00:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218464 states. [2019-09-07 22:00:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218464 states to 218464 states and 252475 transitions. [2019-09-07 22:00:26,096 INFO L78 Accepts]: Start accepts. Automaton has 218464 states and 252475 transitions. Word has length 733 [2019-09-07 22:00:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:00:26,097 INFO L475 AbstractCegarLoop]: Abstraction has 218464 states and 252475 transitions. [2019-09-07 22:00:26,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:00:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 218464 states and 252475 transitions. [2019-09-07 22:00:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2019-09-07 22:00:26,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:00:26,147 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:00:26,147 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:00:26,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:00:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2134267715, now seen corresponding path program 1 times [2019-09-07 22:00:26,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:00:26,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:00:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:00:26,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:00:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:00:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:00:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 100 proven. 511 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2019-09-07 22:00:28,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:00:28,026 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 22:00:28,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:00:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:00:28,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:00:28,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:00:28,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:00:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 590 proven. 2 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2019-09-07 22:00:31,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:00:31,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 22:00:31,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:00:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:00:31,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:00:31,775 INFO L87 Difference]: Start difference. First operand 218464 states and 252475 transitions. Second operand 13 states. [2019-09-07 22:01:38,176 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-07 22:01:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:01:50,890 INFO L93 Difference]: Finished difference Result 485704 states and 559434 transitions. [2019-09-07 22:01:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 22:01:50,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 775 [2019-09-07 22:01:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:01:51,510 INFO L225 Difference]: With dead ends: 485704 [2019-09-07 22:01:51,510 INFO L226 Difference]: Without dead ends: 267616 [2019-09-07 22:01:51,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=719, Invalid=4981, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 22:01:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267616 states. [2019-09-07 22:01:58,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267616 to 255326. [2019-09-07 22:01:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255326 states. [2019-09-07 22:01:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255326 states to 255326 states and 288329 transitions. [2019-09-07 22:01:58,723 INFO L78 Accepts]: Start accepts. Automaton has 255326 states and 288329 transitions. Word has length 775 [2019-09-07 22:01:58,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:01:58,723 INFO L475 AbstractCegarLoop]: Abstraction has 255326 states and 288329 transitions. [2019-09-07 22:01:58,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 22:01:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 255326 states and 288329 transitions. [2019-09-07 22:01:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2019-09-07 22:01:58,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:01:58,770 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:58,770 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:01:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:01:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1243127886, now seen corresponding path program 1 times [2019-09-07 22:01:58,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:01:58,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:01:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:01:58,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:01:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:01:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 22:01:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 22:01:59,232 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 22:01:59,237 INFO L168 Benchmark]: Toolchain (without parser) took 575885.47 ms. Allocated memory was 134.7 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 82.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-09-07 22:01:59,238 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 22:01:59,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1889.72 ms. Allocated memory was 134.7 MB in the beginning and 229.6 MB in the end (delta: 94.9 MB). Free memory was 82.1 MB in the beginning and 96.3 MB in the end (delta: -14.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2019-09-07 22:01:59,240 INFO L168 Benchmark]: Boogie Preprocessor took 314.78 ms. Allocated memory was 229.6 MB in the beginning and 261.6 MB in the end (delta: 32.0 MB). Free memory was 96.3 MB in the beginning and 205.6 MB in the end (delta: -109.2 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2019-09-07 22:01:59,243 INFO L168 Benchmark]: RCFGBuilder took 4517.45 ms. Allocated memory was 261.6 MB in the beginning and 351.8 MB in the end (delta: 90.2 MB). Free memory was 205.6 MB in the beginning and 136.8 MB in the end (delta: 68.8 MB). Peak memory consumption was 159.0 MB. Max. memory is 7.1 GB. [2019-09-07 22:01:59,246 INFO L168 Benchmark]: TraceAbstraction took 569159.18 ms. Allocated memory was 351.8 MB in the beginning and 3.3 GB in the end (delta: 3.0 GB). Free memory was 133.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-07 22:01:59,255 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1889.72 ms. Allocated memory was 134.7 MB in the beginning and 229.6 MB in the end (delta: 94.9 MB). Free memory was 82.1 MB in the beginning and 96.3 MB in the end (delta: -14.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 314.78 ms. Allocated memory was 229.6 MB in the beginning and 261.6 MB in the end (delta: 32.0 MB). Free memory was 96.3 MB in the beginning and 205.6 MB in the end (delta: -109.2 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4517.45 ms. Allocated memory was 261.6 MB in the beginning and 351.8 MB in the end (delta: 90.2 MB). Free memory was 205.6 MB in the beginning and 136.8 MB in the end (delta: 68.8 MB). Peak memory consumption was 159.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 569159.18 ms. Allocated memory was 351.8 MB in the beginning and 3.3 GB in the end (delta: 3.0 GB). Free memory was 133.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 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...