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/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:49,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:49,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:49,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:49,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:49,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:49,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:49,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:49,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:49,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:49,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:49,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:49,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:50,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:50,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:50,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:50,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:50,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:50,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:50,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:50,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:50,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:50,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:50,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:50,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:50,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:50,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:50,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:50,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:50,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:50,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:50,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:50,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:50,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:50,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:50,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:50,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:50,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:50,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:50,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:50,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:50,025 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-10-13 19:14:50,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:50,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:50,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:50,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:50,041 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:50,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:50,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:50,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:50,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:50,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:50,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:50,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:50,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:50,043 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:50,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:50,043 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:50,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:50,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:50,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:50,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:50,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:50,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:50,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:50,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:50,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:50,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:50,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:50,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:50,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:50,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:50,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:50,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:50,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:50,331 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:50,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2019-10-13 19:14:50,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076235619/9095d06e7fc24f449e8729ae69059777/FLAG48dc2b102 [2019-10-13 19:14:50,895 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:50,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-10-13 19:14:50,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076235619/9095d06e7fc24f449e8729ae69059777/FLAG48dc2b102 [2019-10-13 19:14:51,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076235619/9095d06e7fc24f449e8729ae69059777 [2019-10-13 19:14:51,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:51,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:51,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:51,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:51,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:51,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2089993a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51, skipping insertion in model container [2019-10-13 19:14:51,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,302 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:51,321 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:51,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:51,489 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:51,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:51,521 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:51,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51 WrapperNode [2019-10-13 19:14:51,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:51,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:51,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:51,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:51,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (1/1) ... [2019-10-13 19:14:51,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:51,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:51,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:51,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:51,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (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-10-13 19:14:51,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:51,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:51,707 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:51,951 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:51,952 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:51,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:51 BoogieIcfgContainer [2019-10-13 19:14:51,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:51,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:51,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:51,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:51,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:51" (1/3) ... [2019-10-13 19:14:51,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478c644d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:51, skipping insertion in model container [2019-10-13 19:14:51,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (2/3) ... [2019-10-13 19:14:51,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478c644d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:51, skipping insertion in model container [2019-10-13 19:14:51,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:51" (3/3) ... [2019-10-13 19:14:51,983 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-10-13 19:14:51,997 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:52,005 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:52,035 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:52,064 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:52,064 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:52,064 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:52,064 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:52,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:52,065 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:52,065 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:52,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-13 19:14:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:14:52,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,088 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:52,090 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-10-13 19:14:52,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902460180] [2019-10-13 19:14:52,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:52,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902460180] [2019-10-13 19:14:52,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275330570] [2019-10-13 19:14:52,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,279 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-10-13 19:14:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,358 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-10-13 19:14:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 19:14:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,372 INFO L225 Difference]: With dead ends: 57 [2019-10-13 19:14:52,373 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 19:14:52,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 19:14:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-10-13 19:14:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 19:14:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-10-13 19:14:52,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-10-13 19:14:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,429 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-10-13 19:14:52,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-10-13 19:14:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:14:52,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:52,436 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-10-13 19:14:52,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982018866] [2019-10-13 19:14:52,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:52,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982018866] [2019-10-13 19:14:52,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018469572] [2019-10-13 19:14:52,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,524 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-10-13 19:14:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,568 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2019-10-13 19:14:52,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 19:14:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,571 INFO L225 Difference]: With dead ends: 67 [2019-10-13 19:14:52,571 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 19:14:52,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 19:14:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-13 19:14:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 19:14:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-10-13 19:14:52,590 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-10-13 19:14:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,591 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-10-13 19:14:52,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-10-13 19:14:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:14:52,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,593 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:52,594 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-10-13 19:14:52,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106078085] [2019-10-13 19:14:52,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:52,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106078085] [2019-10-13 19:14:52,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789933693] [2019-10-13 19:14:52,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,654 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-10-13 19:14:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,675 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2019-10-13 19:14:52,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 19:14:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,677 INFO L225 Difference]: With dead ends: 63 [2019-10-13 19:14:52,677 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 19:14:52,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 19:14:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-13 19:14:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 19:14:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-10-13 19:14:52,686 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-10-13 19:14:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,687 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-10-13 19:14:52,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-10-13 19:14:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:14:52,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:52,689 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-10-13 19:14:52,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336826699] [2019-10-13 19:14:52,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:52,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336826699] [2019-10-13 19:14:52,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816804408] [2019-10-13 19:14:52,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,740 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-10-13 19:14:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,778 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2019-10-13 19:14:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 19:14:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,781 INFO L225 Difference]: With dead ends: 76 [2019-10-13 19:14:52,781 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 19:14:52,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 19:14:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-10-13 19:14:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 19:14:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-10-13 19:14:52,800 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-10-13 19:14:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,801 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-10-13 19:14:52,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-10-13 19:14:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:14:52,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:52,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-10-13 19:14:52,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115436343] [2019-10-13 19:14:52,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:52,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115436343] [2019-10-13 19:14:52,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067712236] [2019-10-13 19:14:52,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,878 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-10-13 19:14:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,908 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2019-10-13 19:14:52,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 19:14:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,910 INFO L225 Difference]: With dead ends: 124 [2019-10-13 19:14:52,910 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 19:14:52,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 19:14:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-10-13 19:14:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-13 19:14:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-10-13 19:14:52,920 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-10-13 19:14:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,921 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-10-13 19:14:52,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-10-13 19:14:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:14:52,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,922 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:52,923 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-10-13 19:14:52,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637945287] [2019-10-13 19:14:52,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:52,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637945287] [2019-10-13 19:14:52,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799079742] [2019-10-13 19:14:52,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,963 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-10-13 19:14:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,994 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2019-10-13 19:14:52,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 19:14:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,996 INFO L225 Difference]: With dead ends: 111 [2019-10-13 19:14:52,996 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 19:14:52,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 19:14:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-13 19:14:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 19:14:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-10-13 19:14:53,014 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-10-13 19:14:53,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,014 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-10-13 19:14:53,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-10-13 19:14:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:14:53,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,018 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,018 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-10-13 19:14:53,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020435939] [2019-10-13 19:14:53,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020435939] [2019-10-13 19:14:53,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874214411] [2019-10-13 19:14:53,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,071 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-10-13 19:14:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,097 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2019-10-13 19:14:53,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 19:14:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,100 INFO L225 Difference]: With dead ends: 132 [2019-10-13 19:14:53,100 INFO L226 Difference]: Without dead ends: 130 [2019-10-13 19:14:53,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-13 19:14:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-10-13 19:14:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-13 19:14:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-10-13 19:14:53,118 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-10-13 19:14:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,119 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-10-13 19:14:53,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-10-13 19:14:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:14:53,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,121 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,123 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-10-13 19:14:53,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051620672] [2019-10-13 19:14:53,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051620672] [2019-10-13 19:14:53,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231242333] [2019-10-13 19:14:53,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,160 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-10-13 19:14:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,190 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-10-13 19:14:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 19:14:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,192 INFO L225 Difference]: With dead ends: 232 [2019-10-13 19:14:53,192 INFO L226 Difference]: Without dead ends: 138 [2019-10-13 19:14:53,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-13 19:14:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-13 19:14:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-13 19:14:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-10-13 19:14:53,207 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-10-13 19:14:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,208 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-10-13 19:14:53,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-10-13 19:14:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:53,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,209 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,210 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-10-13 19:14:53,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855412973] [2019-10-13 19:14:53,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855412973] [2019-10-13 19:14:53,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865426481] [2019-10-13 19:14:53,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,243 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-10-13 19:14:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,261 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2019-10-13 19:14:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,263 INFO L225 Difference]: With dead ends: 204 [2019-10-13 19:14:53,273 INFO L226 Difference]: Without dead ends: 142 [2019-10-13 19:14:53,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-13 19:14:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-10-13 19:14:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-13 19:14:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-10-13 19:14:53,287 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-10-13 19:14:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,287 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-10-13 19:14:53,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-10-13 19:14:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:53,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,292 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,293 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-10-13 19:14:53,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001472472] [2019-10-13 19:14:53,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001472472] [2019-10-13 19:14:53,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954448618] [2019-10-13 19:14:53,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,342 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-10-13 19:14:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,368 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2019-10-13 19:14:53,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:53,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,370 INFO L225 Difference]: With dead ends: 236 [2019-10-13 19:14:53,371 INFO L226 Difference]: Without dead ends: 234 [2019-10-13 19:14:53,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-13 19:14:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-10-13 19:14:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-13 19:14:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-10-13 19:14:53,385 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-10-13 19:14:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,385 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-10-13 19:14:53,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-10-13 19:14:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:53,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,387 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,388 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-10-13 19:14:53,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635633437] [2019-10-13 19:14:53,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635633437] [2019-10-13 19:14:53,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247448767] [2019-10-13 19:14:53,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,429 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-10-13 19:14:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,489 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2019-10-13 19:14:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,492 INFO L225 Difference]: With dead ends: 444 [2019-10-13 19:14:53,493 INFO L226 Difference]: Without dead ends: 258 [2019-10-13 19:14:53,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-13 19:14:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-13 19:14:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-13 19:14:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-10-13 19:14:53,538 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-10-13 19:14:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,539 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-10-13 19:14:53,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-10-13 19:14:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:53,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,548 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-10-13 19:14:53,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145190000] [2019-10-13 19:14:53,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145190000] [2019-10-13 19:14:53,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575785996] [2019-10-13 19:14:53,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,592 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-10-13 19:14:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,618 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2019-10-13 19:14:53,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,620 INFO L225 Difference]: With dead ends: 384 [2019-10-13 19:14:53,620 INFO L226 Difference]: Without dead ends: 266 [2019-10-13 19:14:53,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-13 19:14:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-10-13 19:14:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-13 19:14:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-10-13 19:14:53,638 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-10-13 19:14:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,638 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-10-13 19:14:53,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-10-13 19:14:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:53,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,644 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-10-13 19:14:53,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680126719] [2019-10-13 19:14:53,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680126719] [2019-10-13 19:14:53,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038274412] [2019-10-13 19:14:53,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,695 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-10-13 19:14:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,726 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2019-10-13 19:14:53,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,731 INFO L225 Difference]: With dead ends: 426 [2019-10-13 19:14:53,731 INFO L226 Difference]: Without dead ends: 424 [2019-10-13 19:14:53,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-13 19:14:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-10-13 19:14:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-13 19:14:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-10-13 19:14:53,749 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-10-13 19:14:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,750 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-10-13 19:14:53,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-10-13 19:14:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:53,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,753 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,753 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-10-13 19:14:53,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772387398] [2019-10-13 19:14:53,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772387398] [2019-10-13 19:14:53,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083111666] [2019-10-13 19:14:53,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,803 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-10-13 19:14:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,832 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2019-10-13 19:14:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,833 INFO L225 Difference]: With dead ends: 856 [2019-10-13 19:14:53,833 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:53,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:53,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-13 19:14:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,837 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:53,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:53,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:53,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:53,861 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:14:53,861 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:53,861 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:53,861 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:53,862 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:53,862 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:53,862 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-13 19:14:53,862 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-10-13 19:14:53,862 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2019-10-13 19:14:53,862 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,862 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-13 19:14:53,862 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,863 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,863 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,863 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,863 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,863 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-13 19:14:53,863 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-13 19:14:53,863 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-13 19:14:53,864 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,864 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-10-13 19:14:53,864 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-13 19:14:53,864 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2019-10-13 19:14:53,864 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,864 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2019-10-13 19:14:53,864 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-10-13 19:14:53,865 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-13 19:14:53,865 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-10-13 19:14:53,865 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 19:14:53,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:53 BoogieIcfgContainer [2019-10-13 19:14:53,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:53,876 INFO L168 Benchmark]: Toolchain (without parser) took 2589.29 ms. Allocated memory was 144.7 MB in the beginning and 234.9 MB in the end (delta: 90.2 MB). Free memory was 102.7 MB in the beginning and 151.0 MB in the end (delta: -48.3 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:53,877 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:53,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.47 ms. Allocated memory is still 144.7 MB. Free memory was 102.5 MB in the beginning and 92.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:53,878 INFO L168 Benchmark]: Boogie Preprocessor took 135.38 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 92.1 MB in the beginning and 180.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:53,879 INFO L168 Benchmark]: RCFGBuilder took 296.39 ms. Allocated memory is still 202.4 MB. Free memory was 180.6 MB in the beginning and 166.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:53,880 INFO L168 Benchmark]: TraceAbstraction took 1908.11 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 165.3 MB in the beginning and 151.0 MB in the end (delta: 14.3 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:53,884 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.49 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 235.47 ms. Allocated memory is still 144.7 MB. Free memory was 102.5 MB in the beginning and 92.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.38 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 92.1 MB in the beginning and 180.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 296.39 ms. Allocated memory is still 202.4 MB. Free memory was 180.6 MB in the beginning and 166.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1908.11 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 165.3 MB in the beginning and 151.0 MB in the end (delta: 14.3 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 1.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...