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-13a467a-m [2019-10-14 23:13:50,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:50,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:50,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:50,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:50,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:50,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:50,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:50,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:50,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:50,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:50,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:50,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:50,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:50,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:50,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:50,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:50,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:50,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:50,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:50,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:50,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:50,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:50,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:50,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:50,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:50,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:50,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:50,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:50,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:50,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:50,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:50,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:50,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:50,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:50,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:50,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:50,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:50,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:50,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:50,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:50,764 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-14 23:13:50,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:50,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:50,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:50,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:50,791 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:50,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:50,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:50,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:50,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:50,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:50,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:50,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:50,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:50,793 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:50,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:50,793 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:50,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:50,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:50,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:50,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:50,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:50,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:50,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:50,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:50,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:50,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:50,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:50,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:50,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:51,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:51,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:51,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:51,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:51,091 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:51,091 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-14 23:13:51,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee843c6/e1434507dd0c431685a25ecffaf23318/FLAGd0cb815ef [2019-10-14 23:13:51,641 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:51,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-10-14 23:13:51,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee843c6/e1434507dd0c431685a25ecffaf23318/FLAGd0cb815ef [2019-10-14 23:13:52,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee843c6/e1434507dd0c431685a25ecffaf23318 [2019-10-14 23:13:52,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:52,048 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:52,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:52,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:52,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:52,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f51de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52, skipping insertion in model container [2019-10-14 23:13:52,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,067 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:52,089 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:52,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:52,259 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:52,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:52,290 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:52,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52 WrapperNode [2019-10-14 23:13:52,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:52,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:52,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:52,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:52,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:52,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:52,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:52,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:52,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (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-14 23:13:52,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:52,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:52,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:52,712 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:52,712 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:52,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:52 BoogieIcfgContainer [2019-10-14 23:13:52,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:52,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:52,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:52,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:52,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:52" (1/3) ... [2019-10-14 23:13:52,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@972f46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:52, skipping insertion in model container [2019-10-14 23:13:52,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (2/3) ... [2019-10-14 23:13:52,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@972f46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:52, skipping insertion in model container [2019-10-14 23:13:52,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:52" (3/3) ... [2019-10-14 23:13:52,730 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-10-14 23:13:52,739 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:52,746 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:52,757 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:52,781 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:52,781 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:52,781 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:52,781 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:52,781 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:52,782 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:52,782 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:52,782 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-14 23:13:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:13:52,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,808 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:52,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,816 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-10-14 23:13:52,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891406929] [2019-10-14 23:13:52,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,973 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-14 23:13:52,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891406929] [2019-10-14 23:13:52,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245292023] [2019-10-14 23:13:52,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,993 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-10-14 23:13:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,044 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-10-14 23:13:53,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-14 23:13:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,059 INFO L225 Difference]: With dead ends: 57 [2019-10-14 23:13:53,059 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 23:13:53,062 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-14 23:13:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 23:13:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-10-14 23:13:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 23:13:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-10-14 23:13:53,102 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-10-14 23:13:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,102 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-10-14 23:13:53,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-10-14 23:13:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:13:53,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,104 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,105 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,105 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-10-14 23:13:53,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277321066] [2019-10-14 23:13:53,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,159 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-14 23:13:53,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277321066] [2019-10-14 23:13:53,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203108840] [2019-10-14 23:13:53,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,164 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-10-14 23:13:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,209 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2019-10-14 23:13:53,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-14 23:13:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,212 INFO L225 Difference]: With dead ends: 67 [2019-10-14 23:13:53,212 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 23:13:53,213 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-14 23:13:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 23:13:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-14 23:13:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-14 23:13:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-10-14 23:13:53,224 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-10-14 23:13:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,224 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-10-14 23:13:53,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-10-14 23:13:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:13:53,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,225 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,226 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-10-14 23:13:53,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948612799] [2019-10-14 23:13:53,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,293 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-14 23:13:53,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948612799] [2019-10-14 23:13:53,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994575664] [2019-10-14 23:13:53,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,296 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-10-14 23:13:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,328 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2019-10-14 23:13:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-14 23:13:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,331 INFO L225 Difference]: With dead ends: 63 [2019-10-14 23:13:53,331 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:13:53,332 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-14 23:13:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:13:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-14 23:13:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 23:13:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-10-14 23:13:53,340 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-10-14 23:13:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,340 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-10-14 23:13:53,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-10-14 23:13:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:13:53,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-10-14 23:13:53,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804796695] [2019-10-14 23:13:53,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,381 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-14 23:13:53,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804796695] [2019-10-14 23:13:53,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486555369] [2019-10-14 23:13:53,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,386 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-10-14 23:13:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,420 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2019-10-14 23:13:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-14 23:13:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,426 INFO L225 Difference]: With dead ends: 76 [2019-10-14 23:13:53,427 INFO L226 Difference]: Without dead ends: 74 [2019-10-14 23:13:53,427 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-14 23:13:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-14 23:13:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-10-14 23:13:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-14 23:13:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-10-14 23:13:53,455 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-10-14 23:13:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,456 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-10-14 23:13:53,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,456 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-10-14 23:13:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:13:53,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,460 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,460 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-10-14 23:13:53,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956511314] [2019-10-14 23:13:53,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,510 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-14 23:13:53,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956511314] [2019-10-14 23:13:53,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340444860] [2019-10-14 23:13:53,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,513 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-10-14 23:13:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,551 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2019-10-14 23:13:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-14 23:13:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,554 INFO L225 Difference]: With dead ends: 124 [2019-10-14 23:13:53,554 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 23:13:53,555 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-14 23:13:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 23:13:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-10-14 23:13:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-14 23:13:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-10-14 23:13:53,564 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-10-14 23:13:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,565 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-10-14 23:13:53,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-10-14 23:13:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:13:53,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,566 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,566 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-10-14 23:13:53,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066989723] [2019-10-14 23:13:53,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,613 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-14 23:13:53,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066989723] [2019-10-14 23:13:53,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036753605] [2019-10-14 23:13:53,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,617 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-10-14 23:13:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,637 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2019-10-14 23:13:53,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-14 23:13:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,639 INFO L225 Difference]: With dead ends: 111 [2019-10-14 23:13:53,639 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 23:13:53,639 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-14 23:13:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 23:13:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-14 23:13:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-14 23:13:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-10-14 23:13:53,647 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-10-14 23:13:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,647 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-10-14 23:13:53,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-10-14 23:13:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:13:53,649 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,649 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,649 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-10-14 23:13:53,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812946133] [2019-10-14 23:13:53,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,688 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-14 23:13:53,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812946133] [2019-10-14 23:13:53,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429757135] [2019-10-14 23:13:53,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,692 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-10-14 23:13:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,724 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2019-10-14 23:13:53,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-14 23:13:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,725 INFO L225 Difference]: With dead ends: 132 [2019-10-14 23:13:53,726 INFO L226 Difference]: Without dead ends: 130 [2019-10-14 23:13:53,726 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-14 23:13:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-14 23:13:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-10-14 23:13:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-14 23:13:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-10-14 23:13:53,737 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-10-14 23:13:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,737 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-10-14 23:13:53,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-10-14 23:13:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:13:53,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,739 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,739 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-10-14 23:13:53,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860897731] [2019-10-14 23:13:53,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,771 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-14 23:13:53,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860897731] [2019-10-14 23:13:53,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549668610] [2019-10-14 23:13:53,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,773 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-10-14 23:13:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,797 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-10-14 23:13:53,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-14 23:13:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,800 INFO L225 Difference]: With dead ends: 232 [2019-10-14 23:13:53,800 INFO L226 Difference]: Without dead ends: 138 [2019-10-14 23:13:53,801 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-14 23:13:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-14 23:13:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-14 23:13:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-14 23:13:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-10-14 23:13:53,813 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-10-14 23:13:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,813 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-10-14 23:13:53,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-10-14 23:13:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:13:53,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,815 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-14 23:13:53,815 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-10-14 23:13:53,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799309566] [2019-10-14 23:13:53,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,863 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-14 23:13:53,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799309566] [2019-10-14 23:13:53,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087879613] [2019-10-14 23:13:53,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,865 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-10-14 23:13:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,882 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2019-10-14 23:13:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:13:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,884 INFO L225 Difference]: With dead ends: 204 [2019-10-14 23:13:53,885 INFO L226 Difference]: Without dead ends: 142 [2019-10-14 23:13:53,886 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-14 23:13:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-14 23:13:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-10-14 23:13:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-14 23:13:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-10-14 23:13:53,907 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-10-14 23:13:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,907 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-10-14 23:13:53,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-10-14 23:13:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:13:53,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,912 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-14 23:13:53,913 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-10-14 23:13:53,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127285632] [2019-10-14 23:13:53,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,944 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-14 23:13:53,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127285632] [2019-10-14 23:13:53,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620979196] [2019-10-14 23:13:53,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,946 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-10-14 23:13:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,964 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2019-10-14 23:13:53,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:13:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,966 INFO L225 Difference]: With dead ends: 236 [2019-10-14 23:13:53,967 INFO L226 Difference]: Without dead ends: 234 [2019-10-14 23:13:53,967 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-14 23:13:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-14 23:13:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-10-14 23:13:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-14 23:13:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-10-14 23:13:53,979 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-10-14 23:13:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,979 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-10-14 23:13:53,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-10-14 23:13:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:13:53,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,981 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-14 23:13:53,981 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-10-14 23:13:53,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187813776] [2019-10-14 23:13:53,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,006 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-14 23:13:54,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187813776] [2019-10-14 23:13:54,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511986547] [2019-10-14 23:13:54,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,008 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-10-14 23:13:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,038 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2019-10-14 23:13:54,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:13:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,040 INFO L225 Difference]: With dead ends: 444 [2019-10-14 23:13:54,040 INFO L226 Difference]: Without dead ends: 258 [2019-10-14 23:13:54,041 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-14 23:13:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-14 23:13:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-14 23:13:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-14 23:13:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-10-14 23:13:54,054 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-10-14 23:13:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,055 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-10-14 23:13:54,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-10-14 23:13:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,057 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-14 23:13:54,057 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-10-14 23:13:54,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441946197] [2019-10-14 23:13:54,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,084 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-14 23:13:54,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441946197] [2019-10-14 23:13:54,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676755698] [2019-10-14 23:13:54,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,087 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-10-14 23:13:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,107 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2019-10-14 23:13:54,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,109 INFO L225 Difference]: With dead ends: 384 [2019-10-14 23:13:54,110 INFO L226 Difference]: Without dead ends: 266 [2019-10-14 23:13:54,111 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-14 23:13:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-14 23:13:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-10-14 23:13:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-14 23:13:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-10-14 23:13:54,122 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-10-14 23:13:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,123 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-10-14 23:13:54,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-10-14 23:13:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,124 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-14 23:13:54,125 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,125 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-10-14 23:13:54,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959940643] [2019-10-14 23:13:54,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,153 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-14 23:13:54,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959940643] [2019-10-14 23:13:54,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731018249] [2019-10-14 23:13:54,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,155 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-10-14 23:13:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,174 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2019-10-14 23:13:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,177 INFO L225 Difference]: With dead ends: 426 [2019-10-14 23:13:54,178 INFO L226 Difference]: Without dead ends: 424 [2019-10-14 23:13:54,178 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-14 23:13:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-14 23:13:54,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-10-14 23:13:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-14 23:13:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-10-14 23:13:54,192 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-10-14 23:13:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,193 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-10-14 23:13:54,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-10-14 23:13:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,194 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-14 23:13:54,195 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,195 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-10-14 23:13:54,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454201530] [2019-10-14 23:13:54,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,214 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-14 23:13:54,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454201530] [2019-10-14 23:13:54,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121243853] [2019-10-14 23:13:54,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,216 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-10-14 23:13:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,239 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2019-10-14 23:13:54,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,240 INFO L225 Difference]: With dead ends: 856 [2019-10-14 23:13:54,240 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:13:54,242 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-14 23:13:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:13:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:13:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:13:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:13:54,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-14 23:13:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,243 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:13:54,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:13:54,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:13:54,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:13:54,284 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:13:54,284 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:54,284 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:54,284 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:13:54,284 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:13:54,285 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:13:54,285 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-14 23:13:54,285 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-10-14 23:13:54,285 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2019-10-14 23:13:54,285 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-14 23:13:54,285 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,285 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-14 23:13:54,286 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,286 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,286 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,286 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,286 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,287 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-14 23:13:54,287 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-14 23:13:54,287 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,287 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-10-14 23:13:54,288 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-14 23:13:54,288 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2019-10-14 23:13:54,288 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,288 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2019-10-14 23:13:54,288 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-10-14 23:13:54,288 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-14 23:13:54,288 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-10-14 23:13:54,289 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-10-14 23:13:54,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:13:54 BoogieIcfgContainer [2019-10-14 23:13:54,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:13:54,303 INFO L168 Benchmark]: Toolchain (without parser) took 2255.40 ms. Allocated memory was 144.2 MB in the beginning and 232.8 MB in the end (delta: 88.6 MB). Free memory was 101.8 MB in the beginning and 147.4 MB in the end (delta: -45.6 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:54,308 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-14 23:13:54,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.21 ms. Allocated memory is still 144.2 MB. Free memory was 101.6 MB in the beginning and 91.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:54,310 INFO L168 Benchmark]: Boogie Preprocessor took 115.81 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 91.7 MB in the beginning and 179.6 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:54,311 INFO L168 Benchmark]: RCFGBuilder took 306.13 ms. Allocated memory is still 201.3 MB. Free memory was 179.6 MB in the beginning and 165.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:54,315 INFO L168 Benchmark]: TraceAbstraction took 1583.07 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 165.0 MB in the beginning and 147.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:54,326 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.21 ms. Allocated memory is still 144.2 MB. Free memory was 101.6 MB in the beginning and 91.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.81 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 91.7 MB in the beginning and 179.6 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 306.13 ms. Allocated memory is still 201.3 MB. Free memory was 179.6 MB in the beginning and 165.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1583.07 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 165.0 MB in the beginning and 147.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 49.1 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.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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.1s 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.3s 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...