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/Problem19_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:53:08,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:53:08,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:53:08,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:53:08,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:53:08,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:53:08,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:53:08,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:53:08,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:53:08,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:53:08,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:53:08,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:53:08,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:53:08,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:53:08,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:53:08,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:53:08,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:53:08,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:53:08,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:53:08,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:53:08,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:53:08,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:53:08,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:53:08,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:53:08,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:53:08,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:53:08,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:53:08,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:53:08,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:53:08,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:53:08,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:53:08,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:53:08,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:53:08,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:53:08,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:53:08,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:53:08,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:53:08,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:53:08,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:53:08,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:53:08,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:53:08,886 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 22:53:08,900 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:53:08,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:53:08,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:53:08,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:53:08,902 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:53:08,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:53:08,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:53:08,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:53:08,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:53:08,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:53:08,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:53:08,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:53:08,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:53:08,904 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:53:08,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:53:08,904 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:53:08,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:53:08,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:53:08,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:53:08,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:53:08,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:53:08,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:53:08,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:53:08,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:53:08,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:53:08,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:53:08,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:53:08,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:53:08,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:53:08,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:53:08,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:53:08,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:53:08,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:53:08,957 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:53:08,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem19_label06.c [2019-09-07 22:53:09,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec683bea/49b5bb540c0649c38c886e859df4ddf1/FLAG7f7f5c8b8 [2019-09-07 22:53:09,883 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:53:09,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem19_label06.c [2019-09-07 22:53:09,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec683bea/49b5bb540c0649c38c886e859df4ddf1/FLAG7f7f5c8b8 [2019-09-07 22:53:10,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec683bea/49b5bb540c0649c38c886e859df4ddf1 [2019-09-07 22:53:10,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:53:10,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:53:10,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:53:10,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:53:10,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:53:10,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:53:10" (1/1) ... [2019-09-07 22:53:10,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da79225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:10, skipping insertion in model container [2019-09-07 22:53:10,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:53:10" (1/1) ... [2019-09-07 22:53:10,367 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:53:10,621 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:53:12,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:53:12,876 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:53:14,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:53:14,172 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:53:14,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14 WrapperNode [2019-09-07 22:53:14,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:53:14,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:53:14,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:53:14,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:53:14,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (1/1) ... [2019-09-07 22:53:14,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (1/1) ... [2019-09-07 22:53:14,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (1/1) ... [2019-09-07 22:53:14,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (1/1) ... [2019-09-07 22:53:14,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (1/1) ... [2019-09-07 22:53:14,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (1/1) ... [2019-09-07 22:53:14,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (1/1) ... [2019-09-07 22:53:14,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:53:14,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:53:14,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:53:14,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:53:14,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (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 22:53:14,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:53:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:53:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:53:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:53:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:53:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 22:53:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output5 [2019-09-07 22:53:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output6 [2019-09-07 22:53:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:53:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:53:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:53:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:53:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 22:53:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output5 [2019-09-07 22:53:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output6 [2019-09-07 22:53:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:53:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:53:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:53:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:53:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:53:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:53:25,866 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:53:25,866 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:53:25,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:53:25 BoogieIcfgContainer [2019-09-07 22:53:25,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:53:25,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:53:25,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:53:25,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:53:25,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:53:10" (1/3) ... [2019-09-07 22:53:25,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9ca356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:53:25, skipping insertion in model container [2019-09-07 22:53:25,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:14" (2/3) ... [2019-09-07 22:53:25,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9ca356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:53:25, skipping insertion in model container [2019-09-07 22:53:25,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:53:25" (3/3) ... [2019-09-07 22:53:25,881 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem19_label06.c [2019-09-07 22:53:25,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:53:25,905 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:53:25,923 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:53:25,978 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:53:25,979 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:53:25,979 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:53:25,979 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:53:25,979 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:53:25,980 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:53:25,980 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:53:25,980 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:53:25,980 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:53:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states. [2019-09-07 22:53:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 22:53:26,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:53:26,042 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] [2019-09-07 22:53:26,044 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:53:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:53:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash -408576230, now seen corresponding path program 1 times [2019-09-07 22:53:26,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:53:26,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:53:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:26,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:53:26,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:53:26,429 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 22:53:26,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:53:26,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:53:26,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:53:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:53:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:53:26,454 INFO L87 Difference]: Start difference. First operand 1777 states. Second operand 3 states. [2019-09-07 22:53:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:53:37,315 INFO L93 Difference]: Finished difference Result 5039 states and 9506 transitions. [2019-09-07 22:53:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:53:37,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-07 22:53:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:53:37,359 INFO L225 Difference]: With dead ends: 5039 [2019-09-07 22:53:37,359 INFO L226 Difference]: Without dead ends: 3200 [2019-09-07 22:53:37,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:53:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-09-07 22:53:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 3152. [2019-09-07 22:53:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3152 states. [2019-09-07 22:53:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 5815 transitions. [2019-09-07 22:53:37,573 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 5815 transitions. Word has length 60 [2019-09-07 22:53:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:53:37,574 INFO L475 AbstractCegarLoop]: Abstraction has 3152 states and 5815 transitions. [2019-09-07 22:53:37,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:53:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 5815 transitions. [2019-09-07 22:53:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 22:53:37,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:53:37,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:53:37,581 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:53:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:53:37,582 INFO L82 PathProgramCache]: Analyzing trace with hash -159863949, now seen corresponding path program 1 times [2019-09-07 22:53:37,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:53:37,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:53:37,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:37,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:53:37,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:53:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:53:37,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:53:37,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:53:37,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:53:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:53:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:53:37,840 INFO L87 Difference]: Start difference. First operand 3152 states and 5815 transitions. Second operand 5 states. [2019-09-07 22:53:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:53:54,200 INFO L93 Difference]: Finished difference Result 9427 states and 17481 transitions. [2019-09-07 22:53:54,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 22:53:54,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-07 22:53:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:53:54,239 INFO L225 Difference]: With dead ends: 9427 [2019-09-07 22:53:54,239 INFO L226 Difference]: Without dead ends: 6281 [2019-09-07 22:53:54,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:53:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2019-09-07 22:53:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 6220. [2019-09-07 22:53:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2019-09-07 22:53:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 9753 transitions. [2019-09-07 22:53:54,447 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 9753 transitions. Word has length 159 [2019-09-07 22:53:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:53:54,448 INFO L475 AbstractCegarLoop]: Abstraction has 6220 states and 9753 transitions. [2019-09-07 22:53:54,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:53:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 9753 transitions. [2019-09-07 22:53:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-07 22:53:54,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:53:54,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:53:54,452 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:53:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:53:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash -825201313, now seen corresponding path program 1 times [2019-09-07 22:53:54,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:53:54,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:53:54,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:54,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:53:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:53:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:53:54,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:53:54,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:53:54,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:53:54,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:53:54,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:53:54,720 INFO L87 Difference]: Start difference. First operand 6220 states and 9753 transitions. Second operand 6 states. [2019-09-07 22:54:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:54:13,604 INFO L93 Difference]: Finished difference Result 18677 states and 29605 transitions. [2019-09-07 22:54:13,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 22:54:13,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2019-09-07 22:54:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:54:13,667 INFO L225 Difference]: With dead ends: 18677 [2019-09-07 22:54:13,676 INFO L226 Difference]: Without dead ends: 12463 [2019-09-07 22:54:13,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:54:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12463 states. [2019-09-07 22:54:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12463 to 12233. [2019-09-07 22:54:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12233 states. [2019-09-07 22:54:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12233 states to 12233 states and 18331 transitions. [2019-09-07 22:54:14,001 INFO L78 Accepts]: Start accepts. Automaton has 12233 states and 18331 transitions. Word has length 169 [2019-09-07 22:54:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:54:14,001 INFO L475 AbstractCegarLoop]: Abstraction has 12233 states and 18331 transitions. [2019-09-07 22:54:14,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:54:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 12233 states and 18331 transitions. [2019-09-07 22:54:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-07 22:54:14,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:54:14,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:54:14,006 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:54:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:54:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1339072234, now seen corresponding path program 1 times [2019-09-07 22:54:14,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:54:14,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:54:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:54:14,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:54:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:54:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:54:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:54:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:54:14,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:54:14,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:54:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:54:14,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:54:14,279 INFO L87 Difference]: Start difference. First operand 12233 states and 18331 transitions. Second operand 6 states. [2019-09-07 22:54:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:54:27,363 INFO L93 Difference]: Finished difference Result 36657 states and 56357 transitions. [2019-09-07 22:54:27,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:54:27,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-09-07 22:54:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:54:27,486 INFO L225 Difference]: With dead ends: 36657 [2019-09-07 22:54:27,486 INFO L226 Difference]: Without dead ends: 24430 [2019-09-07 22:54:27,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:54:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24430 states. [2019-09-07 22:54:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24430 to 24030. [2019-09-07 22:54:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24030 states. [2019-09-07 22:54:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24030 states to 24030 states and 35434 transitions. [2019-09-07 22:54:28,034 INFO L78 Accepts]: Start accepts. Automaton has 24030 states and 35434 transitions. Word has length 224 [2019-09-07 22:54:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:54:28,036 INFO L475 AbstractCegarLoop]: Abstraction has 24030 states and 35434 transitions. [2019-09-07 22:54:28,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:54:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 24030 states and 35434 transitions. [2019-09-07 22:54:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-07 22:54:28,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:54:28,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:54:28,041 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:54:28,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:54:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1696099128, now seen corresponding path program 1 times [2019-09-07 22:54:28,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:54:28,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:54:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:54:28,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:54:28,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:54:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:54:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:54:28,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:54:28,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 22:54:28,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:54:28,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:54:28,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:54:28,562 INFO L87 Difference]: Start difference. First operand 24030 states and 35434 transitions. Second operand 7 states. [2019-09-07 22:54:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:54:59,849 INFO L93 Difference]: Finished difference Result 91348 states and 148775 transitions. [2019-09-07 22:54:59,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 22:54:59,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 276 [2019-09-07 22:54:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:55:00,093 INFO L225 Difference]: With dead ends: 91348 [2019-09-07 22:55:00,093 INFO L226 Difference]: Without dead ends: 67324 [2019-09-07 22:55:00,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:55:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67324 states. [2019-09-07 22:55:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67324 to 65293. [2019-09-07 22:55:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65293 states. [2019-09-07 22:55:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65293 states to 65293 states and 93586 transitions. [2019-09-07 22:55:01,918 INFO L78 Accepts]: Start accepts. Automaton has 65293 states and 93586 transitions. Word has length 276 [2019-09-07 22:55:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:55:01,919 INFO L475 AbstractCegarLoop]: Abstraction has 65293 states and 93586 transitions. [2019-09-07 22:55:01,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:55:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 65293 states and 93586 transitions. [2019-09-07 22:55:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2019-09-07 22:55:01,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:55:01,948 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:55:01,948 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:55:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:55:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1028937445, now seen corresponding path program 1 times [2019-09-07 22:55:01,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:55:01,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:55:01,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:55:01,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:55:01,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:55:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:55:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:55:04,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:55:04,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:55:04,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:55:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:55:04,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:55:05,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:55:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 318 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): Stream closed [2019-09-07 22:55:05,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:55:05,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:55:05,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:55:05,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:55:05,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:55:05,825 INFO L87 Difference]: Start difference. First operand 65293 states and 93586 transitions. Second operand 9 states. [2019-09-07 22:55:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:55:38,844 INFO L93 Difference]: Finished difference Result 196783 states and 328671 transitions. [2019-09-07 22:55:38,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:55:38,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 762 [2019-09-07 22:55:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:55:39,612 INFO L225 Difference]: With dead ends: 196783 [2019-09-07 22:55:39,612 INFO L226 Difference]: Without dead ends: 131496 [2019-09-07 22:55:39,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:55:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131496 states. [2019-09-07 22:55:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131496 to 128833. [2019-09-07 22:55:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128833 states. [2019-09-07 22:55:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128833 states to 128833 states and 200497 transitions. [2019-09-07 22:55:46,030 INFO L78 Accepts]: Start accepts. Automaton has 128833 states and 200497 transitions. Word has length 762 [2019-09-07 22:55:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:55:46,032 INFO L475 AbstractCegarLoop]: Abstraction has 128833 states and 200497 transitions. [2019-09-07 22:55:46,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:55:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 128833 states and 200497 transitions. [2019-09-07 22:55:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2019-09-07 22:55:46,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:55:46,057 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:55:46,058 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:55:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:55:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash -71816165, now seen corresponding path program 1 times [2019-09-07 22:55:46,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:55:46,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:55:46,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:55:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:55:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:55:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:55:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-07 22:55:49,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:55:49,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:55:49,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:55:49,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:55:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:55:49,576 INFO L87 Difference]: Start difference. First operand 128833 states and 200497 transitions. Second operand 4 states. [2019-09-07 22:56:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:56:04,350 INFO L93 Difference]: Finished difference Result 316643 states and 509348 transitions. [2019-09-07 22:56:04,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:56:04,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 771 [2019-09-07 22:56:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:56:05,505 INFO L225 Difference]: With dead ends: 316643 [2019-09-07 22:56:05,506 INFO L226 Difference]: Without dead ends: 187816 [2019-09-07 22:56:05,681 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 22:56:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187816 states. [2019-09-07 22:56:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187816 to 174863. [2019-09-07 22:56:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174863 states. [2019-09-07 22:56:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174863 states to 174863 states and 252848 transitions. [2019-09-07 22:56:08,998 INFO L78 Accepts]: Start accepts. Automaton has 174863 states and 252848 transitions. Word has length 771 [2019-09-07 22:56:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:56:09,000 INFO L475 AbstractCegarLoop]: Abstraction has 174863 states and 252848 transitions. [2019-09-07 22:56:09,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:56:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 174863 states and 252848 transitions. [2019-09-07 22:56:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2019-09-07 22:56:09,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:56:09,030 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:56:09,030 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:56:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:56:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1684983435, now seen corresponding path program 1 times [2019-09-07 22:56:09,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:56:09,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:56:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:56:09,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:56:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:56:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:56:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:56:09,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:56:09,753 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 22:56:09,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:56:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:56:10,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:56:10,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:56:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:56:10,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:56:10,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:56:10,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:56:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:56:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:56:10,978 INFO L87 Difference]: Start difference. First operand 174863 states and 252848 transitions. Second operand 9 states. [2019-09-07 22:56:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:56:51,346 INFO L93 Difference]: Finished difference Result 466310 states and 841754 transitions. [2019-09-07 22:56:51,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 22:56:51,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 817 [2019-09-07 22:56:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:56:52,609 INFO L225 Difference]: With dead ends: 466310 [2019-09-07 22:56:52,609 INFO L226 Difference]: Without dead ends: 291453 [2019-09-07 22:56:52,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 823 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:56:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291453 states. [2019-09-07 22:57:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291453 to 288146. [2019-09-07 22:57:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288146 states. [2019-09-07 22:57:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288146 states to 288146 states and 496115 transitions. [2019-09-07 22:57:06,838 INFO L78 Accepts]: Start accepts. Automaton has 288146 states and 496115 transitions. Word has length 817 [2019-09-07 22:57:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:57:06,839 INFO L475 AbstractCegarLoop]: Abstraction has 288146 states and 496115 transitions. [2019-09-07 22:57:06,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:57:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 288146 states and 496115 transitions. [2019-09-07 22:57:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2019-09-07 22:57:06,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:57:06,858 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:57:06,858 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:57:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:57:06,859 INFO L82 PathProgramCache]: Analyzing trace with hash 725577579, now seen corresponding path program 1 times [2019-09-07 22:57:06,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:57:06,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:57:06,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:57:06,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:57:06,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:57:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:57:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 488 proven. 2 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-07 22:57:13,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:57:13,498 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 22:57:13,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:57:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:57:13,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:57:13,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:57:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 488 proven. 2 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-07 22:57:14,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:57:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:57:14,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:57:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:57:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:57:14,110 INFO L87 Difference]: Start difference. First operand 288146 states and 496115 transitions. Second operand 9 states. [2019-09-07 22:57:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:57:53,220 INFO L93 Difference]: Finished difference Result 617311 states and 1172701 transitions. [2019-09-07 22:57:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 22:57:53,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 935 [2019-09-07 22:57:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:57:54,710 INFO L225 Difference]: With dead ends: 617311 [2019-09-07 22:57:54,711 INFO L226 Difference]: Without dead ends: 329171 [2019-09-07 22:57:56,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:57:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329171 states. [2019-09-07 22:58:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329171 to 327586. [2019-09-07 22:58:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327586 states. [2019-09-07 22:58:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327586 states to 327586 states and 577019 transitions. [2019-09-07 22:58:15,065 INFO L78 Accepts]: Start accepts. Automaton has 327586 states and 577019 transitions. Word has length 935 [2019-09-07 22:58:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:58:15,067 INFO L475 AbstractCegarLoop]: Abstraction has 327586 states and 577019 transitions. [2019-09-07 22:58:15,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:58:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 327586 states and 577019 transitions. [2019-09-07 22:58:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 954 [2019-09-07 22:58:15,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:58:15,085 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:58:15,086 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:58:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:58:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash -136405655, now seen corresponding path program 1 times [2019-09-07 22:58:15,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:58:15,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:58:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:58:15,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:58:15,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:58:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:58:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-09-07 22:58:22,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:58:22,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:58:22,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:58:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:58:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:58:22,627 INFO L87 Difference]: Start difference. First operand 327586 states and 577019 transitions. Second operand 4 states. [2019-09-07 22:58:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:58:58,198 INFO L93 Difference]: Finished difference Result 931255 states and 1834618 transitions. [2019-09-07 22:58:58,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:58:58,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 953 [2019-09-07 22:58:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:59:01,133 INFO L225 Difference]: With dead ends: 931255 [2019-09-07 22:59:01,133 INFO L226 Difference]: Without dead ends: 603675 [2019-09-07 22:59:02,598 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 22:59:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603675 states. [2019-09-07 22:59:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603675 to 580938. [2019-09-07 22:59:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580938 states. [2019-09-07 22:59:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580938 states to 580938 states and 1098228 transitions. [2019-09-07 22:59:47,276 INFO L78 Accepts]: Start accepts. Automaton has 580938 states and 1098228 transitions. Word has length 953 [2019-09-07 22:59:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:59:47,277 INFO L475 AbstractCegarLoop]: Abstraction has 580938 states and 1098228 transitions. [2019-09-07 22:59:47,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:59:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 580938 states and 1098228 transitions. [2019-09-07 22:59:47,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2019-09-07 22:59:47,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:59:47,291 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:59:47,291 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:59:47,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:59:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 993698915, now seen corresponding path program 1 times [2019-09-07 22:59:47,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:59:47,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:59:47,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:59:47,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:59:47,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:59:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:59:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 405 proven. 380 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-07 22:59:58,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:59:58,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:59:58,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:59:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:59:58,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:59:58,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:59:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 628 proven. 2 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-07 22:59:59,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:59:59,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-07 22:59:59,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 22:59:59,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 22:59:59,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 22:59:59,273 INFO L87 Difference]: Start difference. First operand 580938 states and 1098228 transitions. Second operand 12 states.