java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:12:57,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:12:57,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:12:57,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:12:57,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:12:57,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:12:57,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:12:57,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:12:57,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:12:57,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:12:57,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:12:57,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:12:57,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:12:57,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:12:57,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:12:57,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:12:57,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:12:57,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:12:57,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:12:57,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:12:57,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:12:57,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:12:57,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:12:57,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:12:57,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:12:57,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:12:57,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:12:57,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:12:57,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:12:57,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:12:57,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:12:57,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:12:57,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:12:57,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:12:57,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:12:57,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:12:57,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:12:57,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:12:57,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:12:57,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:12:57,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:12:57,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 20:12:57,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:12:57,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:12:57,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:12:57,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:12:57,905 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:12:57,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:12:57,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:12:57,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:12:57,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:12:57,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:12:57,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:12:57,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:12:57,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:12:57,907 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:12:57,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:12:57,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:12:57,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:12:57,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:12:57,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:12:57,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:12:57,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:12:57,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:12:57,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:12:57,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:12:57,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:12:57,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:12:57,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:12:57,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:12:57,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:12:57,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:12:57,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:12:57,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:12:57,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:12:57,978 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:12:57,979 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55.c [2019-09-07 20:12:58,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404455be6/30e65c5f936941d589b27b18df5d17b1/FLAG2430681f8 [2019-09-07 20:12:58,657 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:12:58,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label55.c [2019-09-07 20:12:58,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404455be6/30e65c5f936941d589b27b18df5d17b1/FLAG2430681f8 [2019-09-07 20:12:58,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404455be6/30e65c5f936941d589b27b18df5d17b1 [2019-09-07 20:12:58,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:12:58,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:12:58,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:12:58,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:12:58,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:12:58,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:12:58" (1/1) ... [2019-09-07 20:12:58,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e9ecad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:58, skipping insertion in model container [2019-09-07 20:12:58,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:12:58" (1/1) ... [2019-09-07 20:12:58,940 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:12:59,000 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:12:59,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:12:59,598 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:12:59,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:12:59,811 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:12:59,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59 WrapperNode [2019-09-07 20:12:59,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:12:59,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:12:59,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:12:59,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:12:59,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (1/1) ... [2019-09-07 20:12:59,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (1/1) ... [2019-09-07 20:12:59,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (1/1) ... [2019-09-07 20:12:59,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (1/1) ... [2019-09-07 20:12:59,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (1/1) ... [2019-09-07 20:12:59,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (1/1) ... [2019-09-07 20:12:59,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (1/1) ... [2019-09-07 20:12:59,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:12:59,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:12:59,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:12:59,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:12:59,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:13:00,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:13:00,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:13:00,052 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:13:00,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:13:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:13:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:13:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:13:00,054 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:13:00,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:13:00,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:13:00,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:13:01,683 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:13:01,684 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:13:01,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:13:01 BoogieIcfgContainer [2019-09-07 20:13:01,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:13:01,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:13:01,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:13:01,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:13:01,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:12:58" (1/3) ... [2019-09-07 20:13:01,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c72ef6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:13:01, skipping insertion in model container [2019-09-07 20:13:01,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:12:59" (2/3) ... [2019-09-07 20:13:01,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c72ef6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:13:01, skipping insertion in model container [2019-09-07 20:13:01,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:13:01" (3/3) ... [2019-09-07 20:13:01,706 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label55.c [2019-09-07 20:13:01,718 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:13:01,728 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:13:01,748 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:13:01,796 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:13:01,797 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:13:01,797 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:13:01,797 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:13:01,798 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:13:01,798 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:13:01,798 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:13:01,798 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:13:01,798 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:13:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-07 20:13:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 20:13:01,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:01,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:13:01,839 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 606791250, now seen corresponding path program 1 times [2019-09-07 20:13:01,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:01,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:01,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:13:02,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:13:02,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:13:02,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:13:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:13:02,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:13:02,210 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-09-07 20:13:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:04,007 INFO L93 Difference]: Finished difference Result 890 states and 1607 transitions. [2019-09-07 20:13:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:13:04,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-07 20:13:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:04,031 INFO L225 Difference]: With dead ends: 890 [2019-09-07 20:13:04,032 INFO L226 Difference]: Without dead ends: 554 [2019-09-07 20:13:04,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:13:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-07 20:13:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-09-07 20:13:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-07 20:13:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 806 transitions. [2019-09-07 20:13:04,139 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 806 transitions. Word has length 63 [2019-09-07 20:13:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:04,140 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 806 transitions. [2019-09-07 20:13:04,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:13:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 806 transitions. [2019-09-07 20:13:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-07 20:13:04,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:04,150 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:13:04,150 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:04,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash 905975074, now seen corresponding path program 1 times [2019-09-07 20:13:04,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:04,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:04,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:04,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:13:04,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:13:04,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:13:04,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:13:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:13:04,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:13:04,389 INFO L87 Difference]: Start difference. First operand 554 states and 806 transitions. Second operand 4 states. [2019-09-07 20:13:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:05,930 INFO L93 Difference]: Finished difference Result 2194 states and 3255 transitions. [2019-09-07 20:13:05,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:13:05,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-07 20:13:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:05,944 INFO L225 Difference]: With dead ends: 2194 [2019-09-07 20:13:05,944 INFO L226 Difference]: Without dead ends: 1646 [2019-09-07 20:13:05,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:13:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-09-07 20:13:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1464. [2019-09-07 20:13:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-09-07 20:13:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2038 transitions. [2019-09-07 20:13:06,020 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2038 transitions. Word has length 175 [2019-09-07 20:13:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:06,021 INFO L475 AbstractCegarLoop]: Abstraction has 1464 states and 2038 transitions. [2019-09-07 20:13:06,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:13:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2038 transitions. [2019-09-07 20:13:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-07 20:13:06,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:06,032 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:13:06,033 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 338201322, now seen corresponding path program 1 times [2019-09-07 20:13:06,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:06,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:13:06,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:06,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:06,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:06,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:06,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:13:06,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:06,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:13:06,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:13:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:13:06,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:13:06,582 INFO L87 Difference]: Start difference. First operand 1464 states and 2038 transitions. Second operand 9 states. [2019-09-07 20:13:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:09,737 INFO L93 Difference]: Finished difference Result 4502 states and 6695 transitions. [2019-09-07 20:13:09,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:13:09,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 257 [2019-09-07 20:13:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:09,764 INFO L225 Difference]: With dead ends: 4502 [2019-09-07 20:13:09,765 INFO L226 Difference]: Without dead ends: 2666 [2019-09-07 20:13:09,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:13:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-09-07 20:13:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2256. [2019-09-07 20:13:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2256 states. [2019-09-07 20:13:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3089 transitions. [2019-09-07 20:13:09,894 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3089 transitions. Word has length 257 [2019-09-07 20:13:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:09,895 INFO L475 AbstractCegarLoop]: Abstraction has 2256 states and 3089 transitions. [2019-09-07 20:13:09,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:13:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3089 transitions. [2019-09-07 20:13:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-07 20:13:09,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:09,904 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:13:09,904 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1856536414, now seen corresponding path program 1 times [2019-09-07 20:13:09,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:09,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:09,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:09,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:09,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:13:10,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:10,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:10,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:10,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:10,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 20:13:11,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:13:11,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-07 20:13:11,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:13:11,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:13:11,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:13:11,080 INFO L87 Difference]: Start difference. First operand 2256 states and 3089 transitions. Second operand 12 states. [2019-09-07 20:13:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:14,969 INFO L93 Difference]: Finished difference Result 6732 states and 10286 transitions. [2019-09-07 20:13:14,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:13:14,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 261 [2019-09-07 20:13:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:15,007 INFO L225 Difference]: With dead ends: 6732 [2019-09-07 20:13:15,008 INFO L226 Difference]: Without dead ends: 4482 [2019-09-07 20:13:15,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:13:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2019-09-07 20:13:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4164. [2019-09-07 20:13:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-09-07 20:13:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5662 transitions. [2019-09-07 20:13:15,186 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5662 transitions. Word has length 261 [2019-09-07 20:13:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:15,187 INFO L475 AbstractCegarLoop]: Abstraction has 4164 states and 5662 transitions. [2019-09-07 20:13:15,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:13:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5662 transitions. [2019-09-07 20:13:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-07 20:13:15,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:15,198 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 20:13:15,199 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1816227822, now seen corresponding path program 1 times [2019-09-07 20:13:15,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:15,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 205 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:13:15,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:15,419 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 20:13:15,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:15,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:15,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 205 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:13:15,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:15,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:13:15,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:13:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:13:15,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:13:15,585 INFO L87 Difference]: Start difference. First operand 4164 states and 5662 transitions. Second operand 9 states. [2019-09-07 20:13:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:18,463 INFO L93 Difference]: Finished difference Result 8172 states and 11438 transitions. [2019-09-07 20:13:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:13:18,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 269 [2019-09-07 20:13:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:18,483 INFO L225 Difference]: With dead ends: 8172 [2019-09-07 20:13:18,484 INFO L226 Difference]: Without dead ends: 3628 [2019-09-07 20:13:18,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:13:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-09-07 20:13:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3588. [2019-09-07 20:13:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-09-07 20:13:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4637 transitions. [2019-09-07 20:13:18,609 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 4637 transitions. Word has length 269 [2019-09-07 20:13:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:18,609 INFO L475 AbstractCegarLoop]: Abstraction has 3588 states and 4637 transitions. [2019-09-07 20:13:18,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:13:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 4637 transitions. [2019-09-07 20:13:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-07 20:13:18,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:18,620 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:13:18,620 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1823817087, now seen corresponding path program 1 times [2019-09-07 20:13:18,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:18,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:18,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 162 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:13:18,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:18,911 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) [2019-09-07 20:13:18,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:19,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:19,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-07 20:13:19,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:13:19,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 20:13:19,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:13:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:13:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:13:19,113 INFO L87 Difference]: Start difference. First operand 3588 states and 4637 transitions. Second operand 9 states. [2019-09-07 20:13:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:22,319 INFO L93 Difference]: Finished difference Result 8871 states and 12297 transitions. [2019-09-07 20:13:22,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:13:22,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 280 [2019-09-07 20:13:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:22,357 INFO L225 Difference]: With dead ends: 8871 [2019-09-07 20:13:22,357 INFO L226 Difference]: Without dead ends: 4834 [2019-09-07 20:13:22,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:13:22,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2019-09-07 20:13:22,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4518. [2019-09-07 20:13:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2019-09-07 20:13:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5264 transitions. [2019-09-07 20:13:22,538 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5264 transitions. Word has length 280 [2019-09-07 20:13:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:22,539 INFO L475 AbstractCegarLoop]: Abstraction has 4518 states and 5264 transitions. [2019-09-07 20:13:22,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:13:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5264 transitions. [2019-09-07 20:13:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-07 20:13:22,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:22,557 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:13:22,557 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1614419441, now seen corresponding path program 1 times [2019-09-07 20:13:22,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:22,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:22,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:22,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:22,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 246 proven. 76 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-07 20:13:22,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:22,853 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 20:13:22,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:23,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:23,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 370 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:13:23,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:23,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:13:23,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:13:23,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:13:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:13:23,185 INFO L87 Difference]: Start difference. First operand 4518 states and 5264 transitions. Second operand 9 states. [2019-09-07 20:13:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:24,739 INFO L93 Difference]: Finished difference Result 9292 states and 11025 transitions. [2019-09-07 20:13:24,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:13:24,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 392 [2019-09-07 20:13:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:24,763 INFO L225 Difference]: With dead ends: 9292 [2019-09-07 20:13:24,763 INFO L226 Difference]: Without dead ends: 5330 [2019-09-07 20:13:24,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:13:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2019-09-07 20:13:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 4902. [2019-09-07 20:13:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4902 states. [2019-09-07 20:13:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 5560 transitions. [2019-09-07 20:13:24,969 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 5560 transitions. Word has length 392 [2019-09-07 20:13:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:24,969 INFO L475 AbstractCegarLoop]: Abstraction has 4902 states and 5560 transitions. [2019-09-07 20:13:24,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:13:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 5560 transitions. [2019-09-07 20:13:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-09-07 20:13:24,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:24,984 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:13:24,984 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:24,985 INFO L82 PathProgramCache]: Analyzing trace with hash -795394390, now seen corresponding path program 1 times [2019-09-07 20:13:24,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:24,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:24,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:24,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:24,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 168 proven. 238 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-07 20:13:25,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:25,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:25,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:25,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:13:25,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-09-07 20:13:25,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:13:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:13:25,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:13:25,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:13:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:13:25,829 INFO L87 Difference]: Start difference. First operand 4902 states and 5560 transitions. Second operand 9 states. [2019-09-07 20:13:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:26,940 INFO L93 Difference]: Finished difference Result 7914 states and 8874 transitions. [2019-09-07 20:13:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:13:26,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 449 [2019-09-07 20:13:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:26,963 INFO L225 Difference]: With dead ends: 7914 [2019-09-07 20:13:26,963 INFO L226 Difference]: Without dead ends: 3408 [2019-09-07 20:13:26,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:13:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2019-09-07 20:13:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 3370. [2019-09-07 20:13:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2019-09-07 20:13:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 3582 transitions. [2019-09-07 20:13:27,041 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 3582 transitions. Word has length 449 [2019-09-07 20:13:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:27,041 INFO L475 AbstractCegarLoop]: Abstraction has 3370 states and 3582 transitions. [2019-09-07 20:13:27,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:13:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 3582 transitions. [2019-09-07 20:13:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2019-09-07 20:13:27,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:27,068 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:13:27,070 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:27,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash -201479583, now seen corresponding path program 1 times [2019-09-07 20:13:27,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:27,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:27,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:27,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 564 proven. 782 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 20:13:28,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:28,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:28,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:28,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:28,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2019-09-07 20:13:29,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:13:29,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 19 [2019-09-07 20:13:29,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 20:13:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 20:13:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:13:29,136 INFO L87 Difference]: Start difference. First operand 3370 states and 3582 transitions. Second operand 19 states. [2019-09-07 20:13:33,119 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-07 20:13:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:34,237 INFO L93 Difference]: Finished difference Result 6786 states and 7292 transitions. [2019-09-07 20:13:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 20:13:34,238 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 700 [2019-09-07 20:13:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:34,254 INFO L225 Difference]: With dead ends: 6786 [2019-09-07 20:13:34,255 INFO L226 Difference]: Without dead ends: 3418 [2019-09-07 20:13:34,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=443, Invalid=1719, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 20:13:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2019-09-07 20:13:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3370. [2019-09-07 20:13:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2019-09-07 20:13:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 3539 transitions. [2019-09-07 20:13:34,343 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 3539 transitions. Word has length 700 [2019-09-07 20:13:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:34,344 INFO L475 AbstractCegarLoop]: Abstraction has 3370 states and 3539 transitions. [2019-09-07 20:13:34,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 20:13:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 3539 transitions. [2019-09-07 20:13:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2019-09-07 20:13:34,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:34,366 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 20:13:34,366 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:34,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2014721534, now seen corresponding path program 1 times [2019-09-07 20:13:34,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:34,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:34,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2062 backedges. 519 proven. 1073 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2019-09-07 20:13:36,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:36,233 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) [2019-09-07 20:13:36,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:36,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:13:36,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2062 backedges. 1505 proven. 2 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-09-07 20:13:36,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:36,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 20:13:36,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:13:36,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:13:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:13:36,969 INFO L87 Difference]: Start difference. First operand 3370 states and 3539 transitions. Second operand 11 states. [2019-09-07 20:13:39,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:39,718 INFO L93 Difference]: Finished difference Result 6396 states and 6774 transitions. [2019-09-07 20:13:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 20:13:39,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 831 [2019-09-07 20:13:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:39,732 INFO L225 Difference]: With dead ends: 6396 [2019-09-07 20:13:39,733 INFO L226 Difference]: Without dead ends: 3398 [2019-09-07 20:13:39,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 846 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2019-09-07 20:13:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-09-07 20:13:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3368. [2019-09-07 20:13:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2019-09-07 20:13:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 3527 transitions. [2019-09-07 20:13:39,825 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 3527 transitions. Word has length 831 [2019-09-07 20:13:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:39,827 INFO L475 AbstractCegarLoop]: Abstraction has 3368 states and 3527 transitions. [2019-09-07 20:13:39,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:13:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 3527 transitions. [2019-09-07 20:13:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2019-09-07 20:13:39,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:39,852 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 20:13:39,853 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:39,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1557221466, now seen corresponding path program 1 times [2019-09-07 20:13:39,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:39,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:39,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:39,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 840 proven. 1130 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2019-09-07 20:13:41,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:41,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:42,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:42,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:13:42,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:42,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 1783 proven. 2 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2019-09-07 20:13:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:42,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 20:13:42,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:13:42,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:13:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:13:42,765 INFO L87 Difference]: Start difference. First operand 3368 states and 3527 transitions. Second operand 17 states. [2019-09-07 20:13:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:46,886 INFO L93 Difference]: Finished difference Result 6377 states and 6803 transitions. [2019-09-07 20:13:46,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 20:13:46,887 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 893 [2019-09-07 20:13:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:46,895 INFO L225 Difference]: With dead ends: 6377 [2019-09-07 20:13:46,896 INFO L226 Difference]: Without dead ends: 3285 [2019-09-07 20:13:46,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=548, Invalid=2002, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 20:13:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-09-07 20:13:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3174. [2019-09-07 20:13:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-09-07 20:13:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 3298 transitions. [2019-09-07 20:13:46,962 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 3298 transitions. Word has length 893 [2019-09-07 20:13:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:46,963 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 3298 transitions. [2019-09-07 20:13:46,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:13:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 3298 transitions. [2019-09-07 20:13:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2019-09-07 20:13:46,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:46,979 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:13:46,979 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash -706496335, now seen corresponding path program 1 times [2019-09-07 20:13:46,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:46,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:46,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2549 backedges. 660 proven. 224 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2019-09-07 20:13:47,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:47,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:47,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:47,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:47,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2549 backedges. 1689 proven. 2 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2019-09-07 20:13:48,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:48,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:13:48,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:13:48,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:13:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:13:48,441 INFO L87 Difference]: Start difference. First operand 3174 states and 3298 transitions. Second operand 7 states. [2019-09-07 20:13:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:49,241 INFO L93 Difference]: Finished difference Result 6350 states and 6624 transitions. [2019-09-07 20:13:49,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:13:49,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 900 [2019-09-07 20:13:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:49,251 INFO L225 Difference]: With dead ends: 6350 [2019-09-07 20:13:49,251 INFO L226 Difference]: Without dead ends: 3548 [2019-09-07 20:13:49,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:13:49,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-09-07 20:13:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3540. [2019-09-07 20:13:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3540 states. [2019-09-07 20:13:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 3675 transitions. [2019-09-07 20:13:49,319 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 3675 transitions. Word has length 900 [2019-09-07 20:13:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:49,320 INFO L475 AbstractCegarLoop]: Abstraction has 3540 states and 3675 transitions. [2019-09-07 20:13:49,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:13:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 3675 transitions. [2019-09-07 20:13:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2019-09-07 20:13:49,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:49,339 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:13:49,340 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash 136985470, now seen corresponding path program 1 times [2019-09-07 20:13:49,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:49,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:49,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:49,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:49,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 807 proven. 224 refuted. 0 times theorem prover too weak. 2391 trivial. 0 not checked. [2019-09-07 20:13:50,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:50,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:50,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:50,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:50,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 2229 proven. 2 refuted. 0 times theorem prover too weak. 1191 trivial. 0 not checked. [2019-09-07 20:13:51,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:51,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 20:13:51,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:13:51,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:13:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:13:51,163 INFO L87 Difference]: Start difference. First operand 3540 states and 3675 transitions. Second operand 10 states. [2019-09-07 20:13:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:52,961 INFO L93 Difference]: Finished difference Result 6890 states and 7175 transitions. [2019-09-07 20:13:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:13:52,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1059 [2019-09-07 20:13:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:52,971 INFO L225 Difference]: With dead ends: 6890 [2019-09-07 20:13:52,971 INFO L226 Difference]: Without dead ends: 3722 [2019-09-07 20:13:52,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1066 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:13:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-07 20:13:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3714. [2019-09-07 20:13:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3714 states. [2019-09-07 20:13:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 3816 transitions. [2019-09-07 20:13:53,034 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 3816 transitions. Word has length 1059 [2019-09-07 20:13:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:53,035 INFO L475 AbstractCegarLoop]: Abstraction has 3714 states and 3816 transitions. [2019-09-07 20:13:53,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:13:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 3816 transitions. [2019-09-07 20:13:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2019-09-07 20:13:53,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:53,056 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:13:53,056 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 413107877, now seen corresponding path program 1 times [2019-09-07 20:13:53,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:53,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:53,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:53,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:53,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:53,784 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-07 20:13:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 833 proven. 1481 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2019-09-07 20:13:56,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:56,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:56,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:56,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:13:56,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:56,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:13:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 2267 proven. 2 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2019-09-07 20:13:57,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:57,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2019-09-07 20:13:57,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:13:57,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:13:57,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:13:57,749 INFO L87 Difference]: Start difference. First operand 3714 states and 3816 transitions. Second operand 18 states. [2019-09-07 20:14:00,158 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-07 20:14:00,499 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-07 20:14:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:01,772 INFO L93 Difference]: Finished difference Result 7466 states and 7716 transitions. [2019-09-07 20:14:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 20:14:01,773 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1070 [2019-09-07 20:14:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:01,784 INFO L225 Difference]: With dead ends: 7466 [2019-09-07 20:14:01,784 INFO L226 Difference]: Without dead ends: 4124 [2019-09-07 20:14:01,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1081 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 20:14:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4124 states. [2019-09-07 20:14:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4124 to 3896. [2019-09-07 20:14:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-09-07 20:14:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 4000 transitions. [2019-09-07 20:14:01,855 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 4000 transitions. Word has length 1070 [2019-09-07 20:14:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:01,856 INFO L475 AbstractCegarLoop]: Abstraction has 3896 states and 4000 transitions. [2019-09-07 20:14:01,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:14:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 4000 transitions. [2019-09-07 20:14:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2019-09-07 20:14:01,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:01,876 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:14:01,876 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:01,877 INFO L82 PathProgramCache]: Analyzing trace with hash -338961606, now seen corresponding path program 1 times [2019-09-07 20:14:01,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:01,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:01,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:01,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:01,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 833 proven. 1509 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2019-09-07 20:14:04,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:14:04,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:14:04,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:05,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:14:05,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:14:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 2295 proven. 2 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2019-09-07 20:14:05,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:14:05,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-09-07 20:14:05,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:14:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:14:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:14:05,803 INFO L87 Difference]: Start difference. First operand 3896 states and 4000 transitions. Second operand 18 states. [2019-09-07 20:14:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:10,897 INFO L93 Difference]: Finished difference Result 7648 states and 7897 transitions. [2019-09-07 20:14:10,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 20:14:10,897 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1077 [2019-09-07 20:14:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:10,907 INFO L225 Difference]: With dead ends: 7648 [2019-09-07 20:14:10,907 INFO L226 Difference]: Without dead ends: 3942 [2019-09-07 20:14:10,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1149 GetRequests, 1096 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=578, Invalid=2392, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 20:14:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2019-09-07 20:14:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3894. [2019-09-07 20:14:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3894 states. [2019-09-07 20:14:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3894 states and 3987 transitions. [2019-09-07 20:14:11,007 INFO L78 Accepts]: Start accepts. Automaton has 3894 states and 3987 transitions. Word has length 1077 [2019-09-07 20:14:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:11,008 INFO L475 AbstractCegarLoop]: Abstraction has 3894 states and 3987 transitions. [2019-09-07 20:14:11,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:14:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 3987 transitions. [2019-09-07 20:14:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2019-09-07 20:14:11,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:11,068 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:14:11,068 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2043956975, now seen corresponding path program 1 times [2019-09-07 20:14:11,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:11,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:11,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 886 proven. 2301 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-09-07 20:14:15,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:14:15,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:14:15,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:15,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:14:15,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:14:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 2602 proven. 6 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2019-09-07 20:14:16,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:14:16,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7] total 32 [2019-09-07 20:14:16,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 20:14:16,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 20:14:16,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2019-09-07 20:14:16,777 INFO L87 Difference]: Start difference. First operand 3894 states and 3987 transitions. Second operand 32 states. [2019-09-07 20:14:19,705 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-07 20:14:21,071 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-07 20:14:21,483 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-07 20:14:21,808 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-07 20:14:21,970 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-07 20:14:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:40,044 INFO L93 Difference]: Finished difference Result 8431 states and 8803 transitions. [2019-09-07 20:14:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-07 20:14:40,045 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1158 [2019-09-07 20:14:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:40,047 INFO L225 Difference]: With dead ends: 8431 [2019-09-07 20:14:40,048 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:14:40,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1321 GetRequests, 1197 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2238, Invalid=13014, Unknown=0, NotChecked=0, Total=15252 [2019-09-07 20:14:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:14:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:14:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:14:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:14:40,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1158 [2019-09-07 20:14:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:40,062 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:14:40,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 20:14:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:14:40,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:14:40,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:14:42,276 WARN L188 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 579 DAG size of output: 465 [2019-09-07 20:14:43,707 WARN L188 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 579 DAG size of output: 465 [2019-09-07 20:14:46,370 WARN L188 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 314 DAG size of output: 141 [2019-09-07 20:14:50,150 WARN L188 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 443 DAG size of output: 101 [2019-09-07 20:14:53,897 WARN L188 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 443 DAG size of output: 101 [2019-09-07 20:14:53,900 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:14:53,901 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-09-07 20:14:53,901 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:14:53,901 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-09-07 20:14:53,901 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-09-07 20:14:53,901 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,901 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,901 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,901 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-09-07 20:14:53,902 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:14:53,902 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:14:53,902 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:14:53,902 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-09-07 20:14:53,902 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-09-07 20:14:53,902 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-09-07 20:14:53,902 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-09-07 20:14:53,902 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-09-07 20:14:53,903 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:14:53,904 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-09-07 20:14:53,905 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-09-07 20:14:53,905 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-09-07 20:14:53,905 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-09-07 20:14:53,905 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-09-07 20:14:53,905 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,905 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,905 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,905 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,906 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-09-07 20:14:53,907 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:14:53,908 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:14:53,909 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-09-07 20:14:53,910 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-09-07 20:14:53,911 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:14:53,911 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:14:53,911 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:14:53,911 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-09-07 20:14:53,911 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-09-07 20:14:53,912 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse15 (= 7 |old(~a15~0)|))) (let ((.cse10 (= ~a24~0 1)) (.cse5 (<= ~a12~0 80)) (.cse1 (not (= 1 |old(~a24~0)|))) (.cse2 (not .cse15)) (.cse7 (= ~a12~0 |old(~a12~0)|)) (.cse25 (= ~a24~0 |old(~a24~0)|)) (.cse8 (= ~a21~0 |old(~a21~0)|)) (.cse9 (= ~a15~0 |old(~a15~0)|))) (let ((.cse3 (not (= 6 |old(~a15~0)|))) (.cse20 (not (= 8 |old(~a21~0)|))) (.cse13 (and .cse7 .cse25 .cse8 .cse9)) (.cse18 (not (<= |old(~a21~0)| 6))) (.cse17 (= 6 |old(~a21~0)|)) (.cse19 (or .cse1 .cse2 (not (<= |old(~a21~0)| 7)))) (.cse0 (and .cse25 .cse8 .cse9)) (.cse22 (not (<= 10 |old(~a21~0)|))) (.cse6 (not (= 8 |old(~a15~0)|))) (.cse12 (not (= 7 |old(~a21~0)|))) (.cse21 (not (<= |old(~a12~0)| 11))) (.cse11 (not (= 9 |old(~a15~0)|))) (.cse24 (= ~a21~0 9)) (.cse4 (not (<= |old(~a12~0)| 80))) (.cse16 (not (<= |old(~a15~0)| 7))) (.cse23 (and .cse5 .cse25 .cse8 .cse9)) (.cse14 (and (and (and .cse25 (<= ~a15~0 6)) .cse10) .cse8 .cse9))) (and (or .cse0 (not (<= 8 |old(~a21~0)|)) .cse1 .cse2) (or .cse3 .cse4 .cse5) (or (not (= 10 |old(~a21~0)|)) .cse1 .cse6 (and .cse7 .cse8 .cse9 .cse10)) (or .cse11 .cse12 .cse13 .cse1) (or .cse14 (or .cse15 .cse1 .cse16) .cse17) (or .cse11 (and .cse7 .cse8 .cse10 (= ~a15~0 9)) (not (<= |old(~a12~0)| 95442)) .cse1) (or .cse3 .cse9) (or .cse0 .cse18 .cse19) (or (and .cse7 .cse9 (<= ~a21~0 |old(~a21~0)|) .cse10 (<= 8 ~a21~0)) .cse6 .cse20 .cse1 (forall ((v_~a12~0_444 Int)) (or (not (<= v_~a12~0_444 80)) (not (= 0 (mod (+ v_~a12~0_444 3) 5))) (not (<= |old(~a12~0)| (div (+ v_~a12~0_444 366333) 5))) (not (< 11 v_~a12~0_444))))) (or .cse11 .cse13 .cse1 .cse20) (or .cse13 .cse15 .cse21 .cse18 .cse16) (or .cse11 .cse13 .cse22 .cse1) (or .cse4 .cse2 .cse23) (or (not (= 9 |old(~a21~0)|)) (and .cse7 .cse24 .cse9 .cse10) .cse4 .cse1 .cse6) (or (and .cse7 .cse8 (<= 8 ~a15~0) .cse10 (<= ~a15~0 8)) .cse1 (not (<= 8 |old(~a15~0)|)) .cse18 (not (<= |old(~a15~0)| 8))) (or .cse7 .cse17 (not (<= (+ |old(~a12~0)| 460226) 0)) .cse19) (or .cse0 .cse22 .cse2) (or (and .cse7 .cse9 .cse10 (= ~a21~0 7)) .cse6 .cse12 .cse1 .cse21) (or .cse11 (and .cse7 .cse25 .cse24 .cse9) .cse1 (not (= |old(~a15~0)| |old(~a21~0)|))) (or .cse4 .cse1 .cse16 .cse23) (or .cse1 (not (= 5 |old(~a15~0)|)) .cse14) (or (<= (+ ~a12~0 49) 0) (not (<= (+ |old(~a12~0)| 49) 0)) .cse2))))) [2019-09-07 20:14:53,912 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-09-07 20:14:53,912 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-09-07 20:14:53,912 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,912 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,912 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,912 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,913 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,914 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,915 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-09-07 20:14:53,916 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-09-07 20:14:53,917 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:14:53,918 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,919 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:14:53,920 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-09-07 20:14:53,921 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-09-07 20:14:53,922 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-09-07 20:14:53,923 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:14:53,924 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:14:53,924 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:14:53,924 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-09-07 20:14:53,924 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:14:53,924 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a15~0 8) (= ~a24~0 1) (= ~a21~0 7) (<= (+ ~a12~0 49) 0)) [2019-09-07 20:14:53,924 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:14:53,924 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:14:53,924 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (<= (+ |old(~a12~0)| 49) 0)) (not (= 8 |old(~a15~0)|)) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a24~0 1) (= ~a21~0 7)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|))) [2019-09-07 20:14:53,925 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2019-09-07 20:14:53,925 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse10 (not (= 1 |old(~a24~0)|)))) (let ((.cse17 (or (not (= 9 |old(~a21~0)|)) .cse10 (not (= |old(~a15~0)| |old(~a21~0)|))))) (let ((.cse8 (and .cse17 (<= ~a15~0 6))) (.cse0 (= ~a15~0 7)) (.cse16 (<= ~a15~0 8)) (.cse5 (= ~a24~0 1)) (.cse7 (= ~a15~0 9))) (let ((.cse3 (and .cse5 .cse7)) (.cse11 (<= 10 ~a21~0)) (.cse4 (= ~a21~0 8)) (.cse9 (<= ~a12~0 11)) (.cse6 (= ~a21~0 7)) (.cse1 (= ~a24~0 |old(~a24~0)|)) (.cse14 (and .cse17 (not .cse0) .cse16)) (.cse2 (<= ~a21~0 6)) (.cse13 (= ~a21~0 9)) (.cse15 (<= ~a12~0 80)) (.cse12 (and .cse8 .cse5))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4) (not (= 7 |old(~a21~0)|)) (and .cse0 .cse5 (<= 8 ~a21~0)) (and .cse5 .cse6 .cse7) (and (and .cse8 .cse2) .cse9) (not (<= (+ |old(~a12~0)| 49) 0)) .cse10 (not (= 8 |old(~a15~0)|)) (and .cse11 .cse5 .cse7) (= ~a15~0 6) (and (= ~a21~0 10) .cse1 (= ~a15~0 |old(~a15~0)|)) (and .cse12 (= ~a15~0 5)) (and .cse3 (<= ~a12~0 95442)) (and .cse0 .cse11) (and .cse1 (= ~a21~0 ~a15~0) .cse13) (and (exists ((v_~a12~0_444 Int)) (and (= 0 (mod (+ v_~a12~0_444 3) 5)) (<= ~a12~0 (div (+ v_~a12~0_444 366333) 5)) (<= v_~a12~0_444 80) (< 11 v_~a12~0_444))) (and .cse14 .cse4) .cse5) (and .cse15 .cse0) (and (and .cse9 (and .cse6 .cse16)) .cse1) (and (and (<= 8 ~a15~0) .cse14 .cse2) .cse5) (and .cse13 (and .cse15 .cse5 .cse16)) (and .cse15 .cse8 .cse5) (and (not (= ~a21~0 6)) .cse12)))))) [2019-09-07 20:14:53,925 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-09-07 20:14:53,925 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-09-07 20:14:53,926 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse10 (not (= 1 |old(~a24~0)|)))) (let ((.cse17 (or (not (= 9 |old(~a21~0)|)) .cse10 (not (= |old(~a15~0)| |old(~a21~0)|))))) (let ((.cse8 (and .cse17 (<= ~a15~0 6))) (.cse0 (= ~a15~0 7)) (.cse16 (<= ~a15~0 8)) (.cse5 (= ~a24~0 1)) (.cse7 (= ~a15~0 9))) (let ((.cse3 (and .cse5 .cse7)) (.cse11 (<= 10 ~a21~0)) (.cse4 (= ~a21~0 8)) (.cse9 (<= ~a12~0 11)) (.cse6 (= ~a21~0 7)) (.cse1 (= ~a24~0 |old(~a24~0)|)) (.cse14 (and .cse17 (not .cse0) .cse16)) (.cse2 (<= ~a21~0 6)) (.cse13 (= ~a21~0 9)) (.cse15 (<= ~a12~0 80)) (.cse12 (and .cse8 .cse5))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4) (not (= 7 |old(~a21~0)|)) (and .cse0 .cse5 (<= 8 ~a21~0)) (and .cse5 .cse6 .cse7) (and (and .cse8 .cse2) .cse9) (not (<= (+ |old(~a12~0)| 49) 0)) .cse10 (not (= 8 |old(~a15~0)|)) (and .cse11 .cse5 .cse7) (= ~a15~0 6) (and (= ~a21~0 10) .cse1 (= ~a15~0 |old(~a15~0)|)) (and .cse12 (= ~a15~0 5)) (and .cse3 (<= ~a12~0 95442)) (and .cse0 .cse11) (and .cse1 (= ~a21~0 ~a15~0) .cse13) (and (exists ((v_~a12~0_444 Int)) (and (= 0 (mod (+ v_~a12~0_444 3) 5)) (<= ~a12~0 (div (+ v_~a12~0_444 366333) 5)) (<= v_~a12~0_444 80) (< 11 v_~a12~0_444))) (and .cse14 .cse4) .cse5) (and .cse15 .cse0) (and (and .cse9 (and .cse6 .cse16)) .cse1) (and (and (<= 8 ~a15~0) .cse14 .cse2) .cse5) (and .cse13 (and .cse15 .cse5 .cse16)) (and .cse15 .cse8 .cse5) (and (not (= ~a21~0 6)) .cse12)))))) [2019-09-07 20:14:53,926 INFO L443 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2019-09-07 20:14:53,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:14:53 BoogieIcfgContainer [2019-09-07 20:14:53,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:14:53,956 INFO L168 Benchmark]: Toolchain (without parser) took 115033.80 ms. Allocated memory was 140.0 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 84.0 MB in the beginning and 609.4 MB in the end (delta: -525.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-09-07 20:14:53,956 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 140.0 MB. Free memory was 104.7 MB in the beginning and 104.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:14:53,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.65 ms. Allocated memory was 140.0 MB in the beginning and 201.9 MB in the end (delta: 61.9 MB). Free memory was 83.8 MB in the beginning and 155.0 MB in the end (delta: -71.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-09-07 20:14:53,958 INFO L168 Benchmark]: Boogie Preprocessor took 150.12 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 148.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. [2019-09-07 20:14:53,959 INFO L168 Benchmark]: RCFGBuilder took 1729.01 ms. Allocated memory was 201.9 MB in the beginning and 226.5 MB in the end (delta: 24.6 MB). Free memory was 148.8 MB in the beginning and 144.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. [2019-09-07 20:14:53,959 INFO L168 Benchmark]: TraceAbstraction took 112261.49 ms. Allocated memory was 226.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 144.5 MB in the beginning and 609.4 MB in the end (delta: -464.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-09-07 20:14:53,963 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.44 ms. Allocated memory is still 140.0 MB. Free memory was 104.7 MB in the beginning and 104.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 888.65 ms. Allocated memory was 140.0 MB in the beginning and 201.9 MB in the end (delta: 61.9 MB). Free memory was 83.8 MB in the beginning and 155.0 MB in the end (delta: -71.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 150.12 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 148.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1729.01 ms. Allocated memory was 201.9 MB in the beginning and 226.5 MB in the end (delta: 24.6 MB). Free memory was 148.8 MB in the beginning and 144.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112261.49 ms. Allocated memory was 226.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 144.5 MB in the beginning and 609.4 MB in the end (delta: -464.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2019-09-07 20:14:53,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] [2019-09-07 20:14:53,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_444,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((a15 == 7 && a24 == \old(a24)) && a21 <= 6) || ((a24 == 1 && a15 == 9) && a21 == 8)) || !(7 == \old(a21))) || ((a15 == 7 && a24 == 1) && 8 <= a21)) || ((a24 == 1 && a21 == 7) && a15 == 9)) || (((((!(9 == \old(a21)) || !(1 == \old(a24))) || !(\old(a15) == \old(a21))) && a15 <= 6) && a21 <= 6) && a12 <= 11)) || !(\old(a12) + 49 <= 0)) || !(1 == \old(a24))) || !(8 == \old(a15))) || ((10 <= a21 && a24 == 1) && a15 == 9)) || a15 == 6) || ((a21 == 10 && a24 == \old(a24)) && a15 == \old(a15))) || (((((!(9 == \old(a21)) || !(1 == \old(a24))) || !(\old(a15) == \old(a21))) && a15 <= 6) && a24 == 1) && a15 == 5)) || ((a24 == 1 && a15 == 9) && a12 <= 95442)) || (a15 == 7 && 10 <= a21)) || ((a24 == \old(a24) && a21 == a15) && a21 == 9)) || (((\exists v_~a12~0_444 : int :: ((0 == (v_~a12~0_444 + 3) % 5 && a12 <= (v_~a12~0_444 + 366333) / 5) && v_~a12~0_444 <= 80) && 11 < v_~a12~0_444) && ((((!(9 == \old(a21)) || !(1 == \old(a24))) || !(\old(a15) == \old(a21))) && !(a15 == 7)) && a15 <= 8) && a21 == 8) && a24 == 1)) || (a12 <= 80 && a15 == 7)) || ((a12 <= 11 && a21 == 7 && a15 <= 8) && a24 == \old(a24))) || (((8 <= a15 && (((!(9 == \old(a21)) || !(1 == \old(a24))) || !(\old(a15) == \old(a21))) && !(a15 == 7)) && a15 <= 8) && a21 <= 6) && a24 == 1)) || (a21 == 9 && (a12 <= 80 && a24 == 1) && a15 <= 8)) || ((a12 <= 80 && ((!(9 == \old(a21)) || !(1 == \old(a24))) || !(\old(a15) == \old(a21))) && a15 <= 6) && a24 == 1)) || (!(a21 == 6) && (((!(9 == \old(a21)) || !(1 == \old(a24))) || !(\old(a15) == \old(a21))) && a15 <= 6) && a24 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 112.1s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 66.5s AutomataDifference, 0.0s DeadEndRemovalTime, 13.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 602 SDtfs, 30866 SDslu, 2427 SDs, 0 SdLazy, 43198 SolverSat, 5285 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 42.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10230 GetRequests, 9770 SyntacticMatches, 6 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7636 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4902occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 2213 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 411 PreInvPairs, 605 NumberOfFragments, 1298 HoareAnnotationTreeSize, 411 FomulaSimplifications, 1050020 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 313062 FormulaSimplificationTreeSizeReductionInter, 10.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 19430 NumberOfCodeBlocks, 19430 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 19400 ConstructedInterpolants, 10 QuantifiedInterpolants, 72421147 SizeOfPredicates, 13 NumberOfNonLiveVariables, 13829 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 40479/49602 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...