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/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 23:33:57,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 23:33:57,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 23:33:57,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 23:33:57,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 23:33:57,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 23:33:57,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 23:33:57,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 23:33:57,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 23:33:57,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 23:33:57,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 23:33:57,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 23:33:57,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 23:33:57,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 23:33:57,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 23:33:57,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 23:33:57,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 23:33:57,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 23:33:57,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 23:33:57,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 23:33:57,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 23:33:57,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 23:33:57,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 23:33:57,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 23:33:57,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 23:33:57,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 23:33:57,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 23:33:57,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 23:33:57,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 23:33:57,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 23:33:57,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 23:33:57,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 23:33:57,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 23:33:57,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 23:33:57,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 23:33:57,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 23:33:57,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 23:33:57,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 23:33:57,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 23:33:57,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 23:33:57,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 23:33:57,951 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 23:33:57,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 23:33:57,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 23:33:57,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 23:33:57,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 23:33:57,992 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 23:33:57,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 23:33:57,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 23:33:57,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 23:33:57,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 23:33:57,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 23:33:57,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 23:33:57,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 23:33:57,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 23:33:57,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 23:33:57,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 23:33:57,997 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 23:33:57,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 23:33:57,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 23:33:57,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 23:33:57,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 23:33:57,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 23:33:57,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:33:57,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 23:33:57,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 23:33:57,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 23:33:57,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 23:33:57,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 23:33:57,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 23:33:57,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 23:33:58,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 23:33:58,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 23:33:58,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 23:33:58,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 23:33:58,074 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 23:33:58,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-09-07 23:33:58,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60da4a00a/87f59c704ca044ce81d8445e7068805c/FLAG4d5112233 [2019-09-07 23:33:58,626 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 23:33:58,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-09-07 23:33:58,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60da4a00a/87f59c704ca044ce81d8445e7068805c/FLAG4d5112233 [2019-09-07 23:33:58,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60da4a00a/87f59c704ca044ce81d8445e7068805c [2019-09-07 23:33:58,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 23:33:58,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 23:33:58,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 23:33:58,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 23:33:58,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 23:33:58,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:33:58" (1/1) ... [2019-09-07 23:33:58,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262768b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:58, skipping insertion in model container [2019-09-07 23:33:58,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:33:58" (1/1) ... [2019-09-07 23:33:59,003 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 23:33:59,053 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 23:33:59,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:33:59,477 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 23:33:59,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:33:59,584 INFO L192 MainTranslator]: Completed translation [2019-09-07 23:33:59,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59 WrapperNode [2019-09-07 23:33:59,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 23:33:59,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 23:33:59,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 23:33:59,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 23:33:59,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59" (1/1) ... [2019-09-07 23:33:59,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59" (1/1) ... [2019-09-07 23:33:59,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59" (1/1) ... [2019-09-07 23:33:59,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59" (1/1) ... [2019-09-07 23:33:59,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59" (1/1) ... [2019-09-07 23:33:59,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59" (1/1) ... [2019-09-07 23:33:59,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59" (1/1) ... [2019-09-07 23:33:59,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 23:33:59,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 23:33:59,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 23:33:59,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 23:33:59,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33: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 23:33:59,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 23:33:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 23:33:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 23:33:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 23:33:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 23:33:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 23:33:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 23:33:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 23:34:00,757 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 23:34:00,757 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 23:34:00,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:34:00 BoogieIcfgContainer [2019-09-07 23:34:00,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 23:34:00,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 23:34:00,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 23:34:00,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 23:34:00,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:33:58" (1/3) ... [2019-09-07 23:34:00,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efc94aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:34:00, skipping insertion in model container [2019-09-07 23:34:00,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:59" (2/3) ... [2019-09-07 23:34:00,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efc94aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:34:00, skipping insertion in model container [2019-09-07 23:34:00,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:34:00" (3/3) ... [2019-09-07 23:34:00,783 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-09-07 23:34:00,798 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 23:34:00,807 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 23:34:00,826 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 23:34:00,862 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 23:34:00,863 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 23:34:00,863 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 23:34:00,863 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 23:34:00,863 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 23:34:00,864 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 23:34:00,864 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 23:34:00,864 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 23:34:00,864 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 23:34:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-09-07 23:34:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 23:34:00,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:00,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:00,897 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1483071650, now seen corresponding path program 1 times [2019-09-07 23:34:00,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:00,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:00,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:00,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:00,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:01,057 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 23:34:01,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:01,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 23:34:01,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 23:34:01,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 23:34:01,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 23:34:01,079 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2019-09-07 23:34:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:01,117 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2019-09-07 23:34:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 23:34:01,119 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-07 23:34:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:01,132 INFO L225 Difference]: With dead ends: 222 [2019-09-07 23:34:01,132 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 23:34:01,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 23:34:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 23:34:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-07 23:34:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 23:34:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-09-07 23:34:01,193 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2019-09-07 23:34:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:01,194 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-09-07 23:34:01,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 23:34:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-09-07 23:34:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 23:34:01,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:01,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:01,197 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash -736931587, now seen corresponding path program 1 times [2019-09-07 23:34:01,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:01,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:01,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:01,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:01,287 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 23:34:01,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:01,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:34:01,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:34:01,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:34:01,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:01,294 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-09-07 23:34:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:01,406 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2019-09-07 23:34:01,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:34:01,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-07 23:34:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:01,410 INFO L225 Difference]: With dead ends: 205 [2019-09-07 23:34:01,410 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 23:34:01,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 23:34:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-07 23:34:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-07 23:34:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2019-09-07 23:34:01,443 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2019-09-07 23:34:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:01,443 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2019-09-07 23:34:01,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:34:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2019-09-07 23:34:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 23:34:01,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:01,448 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:01,449 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:01,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1504395429, now seen corresponding path program 1 times [2019-09-07 23:34:01,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:01,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:01,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:01,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:04,153 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 120 DAG size of output: 38 [2019-09-07 23:34:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:04,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:04,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:34:04,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:34:04,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:34:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:34:04,159 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2019-09-07 23:34:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:04,497 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2019-09-07 23:34:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:34:04,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-07 23:34:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:04,501 INFO L225 Difference]: With dead ends: 209 [2019-09-07 23:34:04,501 INFO L226 Difference]: Without dead ends: 190 [2019-09-07 23:34:04,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:34:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-07 23:34:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2019-09-07 23:34:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-07 23:34:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2019-09-07 23:34:04,522 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2019-09-07 23:34:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:04,522 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2019-09-07 23:34:04,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:34:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2019-09-07 23:34:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 23:34:04,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:04,524 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:04,524 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2142865338, now seen corresponding path program 1 times [2019-09-07 23:34:04,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:04,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:04,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:04,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:34:04,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:34:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:34:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:04,567 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2019-09-07 23:34:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:04,599 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2019-09-07 23:34:04,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:34:04,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 23:34:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:04,601 INFO L225 Difference]: With dead ends: 297 [2019-09-07 23:34:04,601 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 23:34:04,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 23:34:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-09-07 23:34:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-07 23:34:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2019-09-07 23:34:04,611 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2019-09-07 23:34:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:04,612 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2019-09-07 23:34:04,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:34:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2019-09-07 23:34:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 23:34:04,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:04,615 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:04,615 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:04,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2011475352, now seen corresponding path program 1 times [2019-09-07 23:34:04,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:04,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:04,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:04,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 23:34:04,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:04,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:34:04,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:34:04,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:34:04,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:04,697 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2019-09-07 23:34:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:04,730 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2019-09-07 23:34:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:34:04,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 23:34:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:04,732 INFO L225 Difference]: With dead ends: 230 [2019-09-07 23:34:04,732 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 23:34:04,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 23:34:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-09-07 23:34:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-07 23:34:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2019-09-07 23:34:04,740 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2019-09-07 23:34:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:04,740 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2019-09-07 23:34:04,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:34:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2019-09-07 23:34:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 23:34:04,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:04,742 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:04,742 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1818456969, now seen corresponding path program 1 times [2019-09-07 23:34:04,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:04,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:04,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:06,855 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (div c_main_~P1~0 2)) (.cse21 (div c_main_~this_expect~0 2))) (let ((.cse17 (* (- 2) .cse21)) (.cse5 (* 2 .cse21)) (.cse19 (* (- 2) .cse20))) (let ((.cse12 (* 4294967296 (div (+ c_main_~P1~0 .cse19) 4294967296))) (.cse7 (* 4 .cse20)) (.cse15 (= .cse5 c_main_~this_expect~0)) (.cse16 (* 4294967296 (div c_main_~this_expect~0 4294967296))) (.cse14 (* 4294967296 (div (+ c_main_~this_expect~0 .cse17) 4294967296))) (.cse4 (* 2 c_main_~P1~0)) (.cse18 (= c_main_~P1~0 (* 2 .cse20)))) (let ((.cse6 (* 4294967296 (div (+ c_main_~P1~0 .cse19 (- 2)) 4294967296))) (.cse0 (< c_main_~P1~0 0)) (.cse10 (not .cse18)) (.cse8 (+ .cse14 .cse4 .cse5)) (.cse11 (or .cse18 (<= 0 c_main_~P1~0))) (.cse1 (< c_main_~this_expect~0 .cse16)) (.cse3 (* 4294967296 (div (+ c_main_~this_expect~0 .cse17 (- 2)) 4294967296))) (.cse2 (not .cse15)) (.cse13 (+ c_main_~this_expect~0 .cse12 .cse7)) (.cse9 (or .cse15 (<= .cse16 c_main_~this_expect~0)))) (or (and .cse0 (or (and .cse1 .cse2 (<= (+ .cse3 .cse4 .cse5 1) (+ c_main_~this_expect~0 .cse6 .cse7))) (and (<= .cse8 (+ c_main_~this_expect~0 .cse6 .cse7 3)) .cse9)) .cse10) (and (or (and .cse1 .cse2 (<= (+ c_main_~this_expect~0 .cse6 .cse7 1) (+ .cse3 .cse4 .cse5))) (and (<= (+ c_main_~this_expect~0 .cse6 .cse7 5) .cse8) .cse9)) .cse0 .cse10) (and .cse11 (or (and (<= (+ c_main_~this_expect~0 .cse12 .cse7 1) .cse8) .cse9) (and .cse1 .cse2 (<= .cse13 (+ .cse3 .cse4 .cse5 3))))) (and .cse11 (or (and .cse1 (<= (+ .cse3 .cse4 .cse5 5) .cse13) .cse2) (and (<= (+ .cse14 .cse4 .cse5 1) .cse13) .cse9)))))))) is different from false [2019-09-07 23:34:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-07 23:34:06,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:06,882 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 23:34:06,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:06,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 23:34:06,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:07,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:07,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-09-07 23:34:07,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 23:34:07,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 23:34:07,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2019-09-07 23:34:07,064 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 7 states. [2019-09-07 23:34:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:07,574 INFO L93 Difference]: Finished difference Result 354 states and 561 transitions. [2019-09-07 23:34:07,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 23:34:07,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-07 23:34:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:07,578 INFO L225 Difference]: With dead ends: 354 [2019-09-07 23:34:07,578 INFO L226 Difference]: Without dead ends: 314 [2019-09-07 23:34:07,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2019-09-07 23:34:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-07 23:34:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279. [2019-09-07 23:34:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-07 23:34:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 438 transitions. [2019-09-07 23:34:07,610 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 438 transitions. Word has length 27 [2019-09-07 23:34:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:07,611 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 438 transitions. [2019-09-07 23:34:07,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 23:34:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 438 transitions. [2019-09-07 23:34:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 23:34:07,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:07,614 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:07,614 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1113591962, now seen corresponding path program 1 times [2019-09-07 23:34:07,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:07,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:07,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:07,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 23:34:07,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:07,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:34:07,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:34:07,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:34:07,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:07,688 INFO L87 Difference]: Start difference. First operand 279 states and 438 transitions. Second operand 3 states. [2019-09-07 23:34:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:07,735 INFO L93 Difference]: Finished difference Result 552 states and 865 transitions. [2019-09-07 23:34:07,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:34:07,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 23:34:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:07,738 INFO L225 Difference]: With dead ends: 552 [2019-09-07 23:34:07,738 INFO L226 Difference]: Without dead ends: 301 [2019-09-07 23:34:07,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-07 23:34:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2019-09-07 23:34:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-07 23:34:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2019-09-07 23:34:07,751 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 29 [2019-09-07 23:34:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:07,753 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2019-09-07 23:34:07,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:34:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2019-09-07 23:34:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 23:34:07,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:07,758 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:07,758 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash 454582667, now seen corresponding path program 1 times [2019-09-07 23:34:07,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:07,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:07,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:07,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:07,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:08,171 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2019-09-07 23:34:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:08,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:08,178 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 23:34:08,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:08,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 23:34:08,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 23:34:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:34:08,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 23:34:08,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:34:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:34:08,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:34:08,290 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand 6 states. [2019-09-07 23:34:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:08,511 INFO L93 Difference]: Finished difference Result 333 states and 502 transitions. [2019-09-07 23:34:08,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 23:34:08,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-07 23:34:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:08,514 INFO L225 Difference]: With dead ends: 333 [2019-09-07 23:34:08,515 INFO L226 Difference]: Without dead ends: 323 [2019-09-07 23:34:08,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 23:34:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-07 23:34:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 295. [2019-09-07 23:34:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-07 23:34:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 446 transitions. [2019-09-07 23:34:08,528 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 446 transitions. Word has length 31 [2019-09-07 23:34:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:08,529 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 446 transitions. [2019-09-07 23:34:08,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:34:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 446 transitions. [2019-09-07 23:34:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 23:34:08,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:08,530 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 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 23:34:08,531 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:08,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:08,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1646630523, now seen corresponding path program 1 times [2019-09-07 23:34:08,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:08,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:08,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:08,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:08,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 23:34:08,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:08,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:34:08,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:34:08,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:34:08,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:08,595 INFO L87 Difference]: Start difference. First operand 295 states and 446 transitions. Second operand 3 states. [2019-09-07 23:34:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:08,623 INFO L93 Difference]: Finished difference Result 514 states and 779 transitions. [2019-09-07 23:34:08,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:34:08,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-07 23:34:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:08,626 INFO L225 Difference]: With dead ends: 514 [2019-09-07 23:34:08,626 INFO L226 Difference]: Without dead ends: 247 [2019-09-07 23:34:08,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-07 23:34:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-09-07 23:34:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-07 23:34:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2019-09-07 23:34:08,635 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 37 [2019-09-07 23:34:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:08,636 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2019-09-07 23:34:08,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:34:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2019-09-07 23:34:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 23:34:08,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:08,637 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:08,637 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash -819577482, now seen corresponding path program 1 times [2019-09-07 23:34:08,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:08,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 23:34:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:08,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:34:08,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:34:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:34:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:08,675 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2019-09-07 23:34:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:08,710 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2019-09-07 23:34:08,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:34:08,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-07 23:34:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:08,712 INFO L225 Difference]: With dead ends: 428 [2019-09-07 23:34:08,712 INFO L226 Difference]: Without dead ends: 229 [2019-09-07 23:34:08,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-07 23:34:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-07 23:34:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-07 23:34:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2019-09-07 23:34:08,721 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2019-09-07 23:34:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:08,721 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2019-09-07 23:34:08,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:34:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2019-09-07 23:34:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 23:34:08,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:08,723 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 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] [2019-09-07 23:34:08,723 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:08,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:08,723 INFO L82 PathProgramCache]: Analyzing trace with hash 711556807, now seen corresponding path program 1 times [2019-09-07 23:34:08,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:08,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:08,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-07 23:34:08,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:34:08,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:34:08,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:34:08,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:34:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:08,774 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2019-09-07 23:34:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:08,805 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2019-09-07 23:34:08,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:34:08,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-07 23:34:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:08,808 INFO L225 Difference]: With dead ends: 309 [2019-09-07 23:34:08,808 INFO L226 Difference]: Without dead ends: 147 [2019-09-07 23:34:08,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:34:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-07 23:34:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-07 23:34:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-07 23:34:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2019-09-07 23:34:08,815 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2019-09-07 23:34:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:08,816 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2019-09-07 23:34:08,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:34:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2019-09-07 23:34:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 23:34:08,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:08,817 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:34:08,817 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash -370372205, now seen corresponding path program 1 times [2019-09-07 23:34:08,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:08,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:08,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 23:34:09,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:09,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 23:34:09,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:34:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:09,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 23:34:09,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-07 23:34:09,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:09,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-07 23:34:09,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 23:34:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 23:34:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-07 23:34:09,201 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 10 states. [2019-09-07 23:34:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:09,333 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2019-09-07 23:34:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 23:34:09,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-09-07 23:34:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:09,335 INFO L225 Difference]: With dead ends: 171 [2019-09-07 23:34:09,335 INFO L226 Difference]: Without dead ends: 164 [2019-09-07 23:34:09,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-07 23:34:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-07 23:34:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-09-07 23:34:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-07 23:34:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2019-09-07 23:34:09,343 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 51 [2019-09-07 23:34:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:09,345 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2019-09-07 23:34:09,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 23:34:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2019-09-07 23:34:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 23:34:09,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:09,346 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 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 23:34:09,346 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -379328264, now seen corresponding path program 1 times [2019-09-07 23:34:09,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:09,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:09,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:09,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:09,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:12,082 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 193 DAG size of output: 24 [2019-09-07 23:34:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:12,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:12,096 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 23:34:12,113 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 23:34:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:12,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 23:34:12,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 23:34:12,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:12,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:12,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:12,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:12,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 23:34:12,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:12,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 23:34:12,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:34:12,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:34:12,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:34:12,373 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand 9 states. [2019-09-07 23:34:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:12,680 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2019-09-07 23:34:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 23:34:12,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-09-07 23:34:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:12,682 INFO L225 Difference]: With dead ends: 182 [2019-09-07 23:34:12,683 INFO L226 Difference]: Without dead ends: 180 [2019-09-07 23:34:12,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-07 23:34:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-07 23:34:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-09-07 23:34:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 23:34:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2019-09-07 23:34:12,699 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 61 [2019-09-07 23:34:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:12,700 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2019-09-07 23:34:12,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:34:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2019-09-07 23:34:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 23:34:12,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:12,701 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 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 23:34:12,702 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash 638427137, now seen corresponding path program 1 times [2019-09-07 23:34:12,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:12,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:12,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:12,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:13,135 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-09-07 23:34:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:13,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:13,164 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 23:34:13,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:13,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 23:34:13,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 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 23:34:13,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:13,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-09-07 23:34:13,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:34:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:34:13,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:34:13,345 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand 9 states. [2019-09-07 23:34:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:13,465 INFO L93 Difference]: Finished difference Result 198 states and 274 transitions. [2019-09-07 23:34:13,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 23:34:13,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-07 23:34:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:13,467 INFO L225 Difference]: With dead ends: 198 [2019-09-07 23:34:13,468 INFO L226 Difference]: Without dead ends: 196 [2019-09-07 23:34:13,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:34:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-07 23:34:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-09-07 23:34:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-07 23:34:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 272 transitions. [2019-09-07 23:34:13,475 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 272 transitions. Word has length 70 [2019-09-07 23:34:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:13,476 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 272 transitions. [2019-09-07 23:34:13,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:34:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 272 transitions. [2019-09-07 23:34:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 23:34:13,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:34:13,477 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 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] [2019-09-07 23:34:13,477 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:34:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:34:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1961279789, now seen corresponding path program 1 times [2019-09-07 23:34:13,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:34:13,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:34:13,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:13,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:13,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:34:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:15,813 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_main_~this_expect~0 2))) (let ((.cse3 (* 2 .cse19)) (.cse18 (* (- 2) .cse19)) (.cse17 (* 4294967296 (div c_main_~this_expect~0 4294967296)))) (let ((.cse8 (<= .cse17 c_main_~this_expect~0)) (.cse6 (div (+ c_main_~this_expect~0 .cse18) 4294967296)) (.cse9 (div (+ c_main_~this_expect~0 .cse18 (- 2)) 4294967296)) (.cse7 (= .cse3 c_main_~this_expect~0))) (let ((.cse0 (< c_main_~this_expect~0 .cse17)) (.cse1 (not .cse7)) (.cse2 (* 4294967296 .cse9)) (.cse4 (* 4294967296 .cse6)) (.cse5 (or .cse7 .cse8))) (or (let ((.cse13 (<= c_main_~this_buffer_empty~0 1)) (.cse15 (div c_main_~this_buffer_empty~0 4294967296))) (and (or (and .cse0 .cse1 (<= c_main_~this_expect~0 (+ .cse2 .cse3 4294967295))) (and (<= c_main_~this_expect~0 (+ .cse4 .cse3 4294967295)) .cse5) (and (or (and .cse0 .cse1) (< 0 (+ .cse6 1))) (or .cse7 .cse8 (< 0 (+ .cse9 1))))) (or (let ((.cse11 (* 4294967296 .cse15))) (let ((.cse10 (+ .cse11 1)) (.cse12 (<= 1 c_main_~this_buffer_empty~0))) (and (or (< .cse10 c_main_~this_buffer_empty~0) (< .cse11 c_main_~this_buffer_empty~0) .cse12) (or (<= c_main_~this_buffer_empty~0 .cse10) (let ((.cse14 (+ .cse15 1))) (and (or .cse13 (<= .cse14 0)) (or (< 0 .cse14) .cse12))))))) (< 0 .cse15)) (let ((.cse16 (+ c_main_~this_expect~0 1))) (or (and (<= .cse16 (+ .cse4 .cse3)) .cse5) (and (<= (+ .cse4 .cse3 1) c_main_~this_expect~0) .cse5) (and (<= .cse16 (+ .cse2 .cse3)) .cse0 .cse1) (and .cse0 .cse1 (<= (+ .cse2 .cse3 1) c_main_~this_expect~0)))) (or .cse13 (<= .cse15 0)))) (and .cse0 .cse1 (<= (+ .cse2 .cse3 4294967297) c_main_~this_expect~0)) (and (<= (+ .cse4 .cse3 4294967297) c_main_~this_expect~0) .cse5)))))) is different from false [2019-09-07 23:34:24,121 WARN L188 SmtUtils]: Spent 8.22 s on a formula simplification. DAG size of input: 149 DAG size of output: 33 [2019-09-07 23:34:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 9 trivial. 6 not checked. [2019-09-07 23:34:24,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:34:24,160 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 23:34:24,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:34:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:34:24,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 23:34:24,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:34:24,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 23:34:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:34:24,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:34:24,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-09-07 23:34:24,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 23:34:24,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 23:34:24,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2019-09-07 23:34:24,491 INFO L87 Difference]: Start difference. First operand 196 states and 272 transitions. Second operand 16 states. [2019-09-07 23:34:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:34:24,827 INFO L93 Difference]: Finished difference Result 215 states and 299 transitions. [2019-09-07 23:34:24,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 23:34:24,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2019-09-07 23:34:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:34:24,828 INFO L225 Difference]: With dead ends: 215 [2019-09-07 23:34:24,828 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 23:34:24,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2019-09-07 23:34:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 23:34:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 23:34:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 23:34:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 23:34:24,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2019-09-07 23:34:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:34:24,832 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 23:34:24,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 23:34:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 23:34:24,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 23:34:24,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 23:34:25,162 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-09-07 23:34:25,166 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 23:34:25,166 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-07 23:34:25,167 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 23:34:25,167 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 23:34:25,167 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 23:34:25,167 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 23:34:25,167 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 23:34:25,167 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2019-09-07 23:34:25,167 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-09-07 23:34:25,167 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-09-07 23:34:25,168 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-09-07 23:34:25,169 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-09-07 23:34:25,169 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-09-07 23:34:25,169 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-09-07 23:34:25,169 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-09-07 23:34:25,170 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-09-07 23:34:25,170 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-09-07 23:34:25,170 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-09-07 23:34:25,170 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-09-07 23:34:25,170 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-09-07 23:34:25,170 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-09-07 23:34:25,170 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-09-07 23:34:25,170 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-09-07 23:34:25,171 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-09-07 23:34:25,171 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-09-07 23:34:25,171 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-09-07 23:34:25,171 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-09-07 23:34:25,171 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-09-07 23:34:25,171 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-09-07 23:34:25,171 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-09-07 23:34:25,171 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-09-07 23:34:25,172 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L439 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-09-07 23:34:25,173 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 (<= (+ (* 2 (div (+ main_~this_expect~0 (- 1)) 2)) 2) main_~this_expect~0) .cse1) (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1))) [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-09-07 23:34:25,174 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L439 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse8 (* 2 (div (+ main_~this_expect~0 (- 1)) 2)))) (let ((.cse4 (<= (+ .cse8 2) main_~this_expect~0)) (.cse5 (<= main_~this_buffer_empty~0 0)) (.cse6 (<= 0 main_~this_buffer_empty~0)) (.cse2 (<= main_~this_buffer_empty~0 1)) (.cse0 (<= 0 (+ main_~P8~0 2147483648))) (.cse7 (<= main_~this_expect~0 (+ .cse8 1))) (.cse3 (<= 1 main_~this_buffer_empty~0)) (.cse1 (<= main_~P8~0 2147483647))) (or (and (and .cse0 .cse1 (= 1 main_~q~0)) .cse2 .cse3 .cse4) (and (<= 5 main_~q~0) .cse0 .cse1 .cse5 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse5 (= 3 main_~q~0) .cse6) (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse5 .cse6) (and (= 4 main_~q~0) .cse2 .cse0 .cse7 .cse3 .cse1)))) [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-09-07 23:34:25,175 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-09-07 23:34:25,176 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-09-07 23:34:25,177 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-09-07 23:34:25,178 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-09-07 23:34:25,178 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-09-07 23:34:25,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 11:34:25 BoogieIcfgContainer [2019-09-07 23:34:25,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 23:34:25,211 INFO L168 Benchmark]: Toolchain (without parser) took 26226.29 ms. Allocated memory was 134.2 MB in the beginning and 348.7 MB in the end (delta: 214.4 MB). Free memory was 89.6 MB in the beginning and 203.6 MB in the end (delta: -114.0 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:25,212 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.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 23:34:25,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.61 ms. Allocated memory was 134.2 MB in the beginning and 200.3 MB in the end (delta: 66.1 MB). Free memory was 89.3 MB in the beginning and 170.4 MB in the end (delta: -81.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:25,217 INFO L168 Benchmark]: Boogie Preprocessor took 111.00 ms. Allocated memory is still 200.3 MB. Free memory was 170.4 MB in the beginning and 166.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:25,217 INFO L168 Benchmark]: RCFGBuilder took 1063.00 ms. Allocated memory is still 200.3 MB. Free memory was 166.9 MB in the beginning and 114.7 MB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:25,218 INFO L168 Benchmark]: TraceAbstraction took 24442.99 ms. Allocated memory was 200.3 MB in the beginning and 348.7 MB in the end (delta: 148.4 MB). Free memory was 114.7 MB in the beginning and 203.6 MB in the end (delta: -88.9 MB). Peak memory consumption was 59.5 MB. Max. memory is 7.1 GB. [2019-09-07 23:34:25,226 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.51 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 602.61 ms. Allocated memory was 134.2 MB in the beginning and 200.3 MB in the end (delta: 66.1 MB). Free memory was 89.3 MB in the beginning and 170.4 MB in the end (delta: -81.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.00 ms. Allocated memory is still 200.3 MB. Free memory was 170.4 MB in the beginning and 166.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1063.00 ms. Allocated memory is still 200.3 MB. Free memory was 166.9 MB in the beginning and 114.7 MB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24442.99 ms. Allocated memory was 200.3 MB in the beginning and 348.7 MB in the end (delta: 148.4 MB). Free memory was 114.7 MB in the beginning and 203.6 MB in the end (delta: -88.9 MB). Peak memory consumption was 59.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 24]: Loop Invariant Derived loop invariant: (((((5 <= q && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 2 * ((this_expect + -1) / 2) + 2 <= this_expect) && 0 <= this_buffer_empty) || ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((((0 <= P8 + 2147483648 && P8 <= 2147483647) && 1 == q) && this_buffer_empty <= 1) && 1 <= this_buffer_empty) && 2 * ((this_expect + -1) / 2) + 2 <= this_expect) || (((((5 <= q && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 2 * ((this_expect + -1) / 2) + 2 <= this_expect) && 0 <= this_buffer_empty)) || (((((0 <= P8 + 2147483648 && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && P8 <= 2147483647) && this_buffer_empty <= 0) && 3 == q) && 0 <= this_buffer_empty)) || ((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || (((((4 == q && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && 1 <= this_buffer_empty) && P8 <= 2147483647) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 24.3s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2348 SDtfs, 2103 SDslu, 6298 SDs, 0 SdLazy, 950 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 334 SyntacticMatches, 14 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred 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: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 93 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 22 NumberOfFragments, 185 HoareAnnotationTreeSize, 7 FomulaSimplifications, 401 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 411 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 892 NumberOfCodeBlocks, 892 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 871 ConstructedInterpolants, 0 QuantifiedInterpolants, 658907 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2228 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 215/668 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...