./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd6d122756047ddb1225c106ac06a6748e14c22 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:59:05,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:59:05,934 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:59:05,941 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:59:05,942 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:59:05,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:59:05,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:59:05,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:59:05,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:59:05,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:59:05,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:59:05,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:59:05,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:59:05,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:59:05,948 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:59:05,949 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:59:05,950 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:59:05,951 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:59:05,952 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:59:05,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:59:05,953 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:59:05,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:59:05,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:59:05,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:59:05,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:59:05,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:59:05,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:59:05,957 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:59:05,958 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:59:05,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:59:05,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:59:05,959 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:59:05,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:59:05,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:59:05,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:59:05,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:59:05,960 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 14:59:05,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:59:05,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:59:05,968 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:59:05,968 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 14:59:05,968 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:59:05,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:59:05,969 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:59:05,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:59:05,969 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:59:05,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:59:05,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:59:05,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:59:05,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:59:05,970 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:59:05,970 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:59:05,970 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:59:05,970 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:59:05,970 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:59:05,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:59:05,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:59:05,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:59:05,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:59:05,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:59:05,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:59:05,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:59:05,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:59:05,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:59:05,972 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:59:05,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:59:05,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:59:05,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-11-18 14:59:05,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:59:06,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:59:06,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:59:06,009 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:59:06,010 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:59:06,010 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:59:06,046 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/data/ff7081156/d35dbc2010df45f9b779db6095176194/FLAG6d18895cb [2018-11-18 14:59:06,443 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:59:06,443 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:59:06,449 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/data/ff7081156/d35dbc2010df45f9b779db6095176194/FLAG6d18895cb [2018-11-18 14:59:06,459 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/data/ff7081156/d35dbc2010df45f9b779db6095176194 [2018-11-18 14:59:06,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:59:06,462 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 14:59:06,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:59:06,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:59:06,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:59:06,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06, skipping insertion in model container [2018-11-18 14:59:06,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:59:06,486 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:59:06,589 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:59:06,591 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:59:06,607 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:59:06,615 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:59:06,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06 WrapperNode [2018-11-18 14:59:06,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:59:06,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:59:06,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:59:06,616 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:59:06,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (1/1) ... [2018-11-18 14:59:06,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:59:06,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:59:06,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:59:06,638 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:59:06,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/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 [2018-11-18 14:59:06,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:59:06,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:59:06,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:59:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 14:59:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 14:59:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:59:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:59:06,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:59:06,912 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:59:06,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:06 BoogieIcfgContainer [2018-11-18 14:59:06,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:59:06,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:59:06,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:59:06,916 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:59:06,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:59:06" (1/3) ... [2018-11-18 14:59:06,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52455178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:59:06, skipping insertion in model container [2018-11-18 14:59:06,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:06" (2/3) ... [2018-11-18 14:59:06,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52455178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:59:06, skipping insertion in model container [2018-11-18 14:59:06,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:06" (3/3) ... [2018-11-18 14:59:06,920 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:59:06,928 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:59:06,934 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:59:06,945 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:59:06,967 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:59:06,967 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:59:06,968 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:59:06,968 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:59:06,968 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:59:06,968 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:59:06,968 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:59:06,968 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:59:06,968 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:59:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-18 14:59:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 14:59:06,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:06,989 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:06,990 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:06,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1900455195, now seen corresponding path program 1 times [2018-11-18 14:59:06,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,133 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-18 14:59:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,166 INFO L93 Difference]: Finished difference Result 71 states and 116 transitions. [2018-11-18 14:59:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 14:59:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,174 INFO L225 Difference]: With dead ends: 71 [2018-11-18 14:59:07,174 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 14:59:07,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 14:59:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-11-18 14:59:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 14:59:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2018-11-18 14:59:07,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2018-11-18 14:59:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,200 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2018-11-18 14:59:07,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2018-11-18 14:59:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 14:59:07,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,200 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,201 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1507428185, now seen corresponding path program 1 times [2018-11-18 14:59:07,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,237 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. [2018-11-18 14:59:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,261 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2018-11-18 14:59:07,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 14:59:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,263 INFO L225 Difference]: With dead ends: 90 [2018-11-18 14:59:07,263 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 14:59:07,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 14:59:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-18 14:59:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 14:59:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2018-11-18 14:59:07,268 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 18 [2018-11-18 14:59:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,268 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2018-11-18 14:59:07,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2018-11-18 14:59:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:59:07,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,269 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,269 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1215216746, now seen corresponding path program 1 times [2018-11-18 14:59:07,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,301 INFO L87 Difference]: Start difference. First operand 54 states and 91 transitions. Second operand 3 states. [2018-11-18 14:59:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,321 INFO L93 Difference]: Finished difference Result 85 states and 139 transitions. [2018-11-18 14:59:07,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:59:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,322 INFO L225 Difference]: With dead ends: 85 [2018-11-18 14:59:07,322 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 14:59:07,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 14:59:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-18 14:59:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 14:59:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 94 transitions. [2018-11-18 14:59:07,327 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 94 transitions. Word has length 19 [2018-11-18 14:59:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,327 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 94 transitions. [2018-11-18 14:59:07,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 94 transitions. [2018-11-18 14:59:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:59:07,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,328 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,328 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,328 INFO L82 PathProgramCache]: Analyzing trace with hash -514152168, now seen corresponding path program 1 times [2018-11-18 14:59:07,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,365 INFO L87 Difference]: Start difference. First operand 58 states and 94 transitions. Second operand 3 states. [2018-11-18 14:59:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,377 INFO L93 Difference]: Finished difference Result 105 states and 173 transitions. [2018-11-18 14:59:07,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:59:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,378 INFO L225 Difference]: With dead ends: 105 [2018-11-18 14:59:07,378 INFO L226 Difference]: Without dead ends: 103 [2018-11-18 14:59:07,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-18 14:59:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2018-11-18 14:59:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 14:59:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 123 transitions. [2018-11-18 14:59:07,384 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 123 transitions. Word has length 19 [2018-11-18 14:59:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,384 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 123 transitions. [2018-11-18 14:59:07,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 123 transitions. [2018-11-18 14:59:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:59:07,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,385 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,385 INFO L82 PathProgramCache]: Analyzing trace with hash -907179178, now seen corresponding path program 1 times [2018-11-18 14:59:07,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,407 INFO L87 Difference]: Start difference. First operand 75 states and 123 transitions. Second operand 3 states. [2018-11-18 14:59:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,428 INFO L93 Difference]: Finished difference Result 171 states and 285 transitions. [2018-11-18 14:59:07,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:59:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,429 INFO L225 Difference]: With dead ends: 171 [2018-11-18 14:59:07,429 INFO L226 Difference]: Without dead ends: 105 [2018-11-18 14:59:07,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-18 14:59:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-18 14:59:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 14:59:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 167 transitions. [2018-11-18 14:59:07,437 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 167 transitions. Word has length 19 [2018-11-18 14:59:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,437 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 167 transitions. [2018-11-18 14:59:07,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 167 transitions. [2018-11-18 14:59:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:59:07,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,438 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,438 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1241366670, now seen corresponding path program 1 times [2018-11-18 14:59:07,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,464 INFO L87 Difference]: Start difference. First operand 103 states and 167 transitions. Second operand 3 states. [2018-11-18 14:59:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,476 INFO L93 Difference]: Finished difference Result 154 states and 248 transitions. [2018-11-18 14:59:07,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:59:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,477 INFO L225 Difference]: With dead ends: 154 [2018-11-18 14:59:07,477 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 14:59:07,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 14:59:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-18 14:59:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 14:59:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-11-18 14:59:07,484 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 20 [2018-11-18 14:59:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,484 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-11-18 14:59:07,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-11-18 14:59:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:59:07,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,485 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1942431248, now seen corresponding path program 1 times [2018-11-18 14:59:07,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,510 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 3 states. [2018-11-18 14:59:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,523 INFO L93 Difference]: Finished difference Result 189 states and 305 transitions. [2018-11-18 14:59:07,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:59:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,524 INFO L225 Difference]: With dead ends: 189 [2018-11-18 14:59:07,524 INFO L226 Difference]: Without dead ends: 187 [2018-11-18 14:59:07,525 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-18 14:59:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2018-11-18 14:59:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 14:59:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 223 transitions. [2018-11-18 14:59:07,532 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 223 transitions. Word has length 20 [2018-11-18 14:59:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,532 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 223 transitions. [2018-11-18 14:59:07,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 223 transitions. [2018-11-18 14:59:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:59:07,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,533 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,533 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1549404238, now seen corresponding path program 1 times [2018-11-18 14:59:07,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,554 INFO L87 Difference]: Start difference. First operand 141 states and 223 transitions. Second operand 3 states. [2018-11-18 14:59:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,576 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-18 14:59:07,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:59:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,577 INFO L225 Difference]: With dead ends: 325 [2018-11-18 14:59:07,577 INFO L226 Difference]: Without dead ends: 195 [2018-11-18 14:59:07,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-18 14:59:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-11-18 14:59:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-18 14:59:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 299 transitions. [2018-11-18 14:59:07,587 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 299 transitions. Word has length 20 [2018-11-18 14:59:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,587 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 299 transitions. [2018-11-18 14:59:07,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 299 transitions. [2018-11-18 14:59:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:59:07,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,588 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,588 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash 86041579, now seen corresponding path program 1 times [2018-11-18 14:59:07,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,612 INFO L87 Difference]: Start difference. First operand 193 states and 299 transitions. Second operand 3 states. [2018-11-18 14:59:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,637 INFO L93 Difference]: Finished difference Result 289 states and 445 transitions. [2018-11-18 14:59:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:59:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,639 INFO L225 Difference]: With dead ends: 289 [2018-11-18 14:59:07,639 INFO L226 Difference]: Without dead ends: 199 [2018-11-18 14:59:07,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-18 14:59:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-11-18 14:59:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-18 14:59:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 299 transitions. [2018-11-18 14:59:07,649 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 299 transitions. Word has length 21 [2018-11-18 14:59:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,650 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 299 transitions. [2018-11-18 14:59:07,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 299 transitions. [2018-11-18 14:59:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:59:07,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,651 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,651 INFO L82 PathProgramCache]: Analyzing trace with hash 787106157, now seen corresponding path program 1 times [2018-11-18 14:59:07,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,669 INFO L87 Difference]: Start difference. First operand 197 states and 299 transitions. Second operand 3 states. [2018-11-18 14:59:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,683 INFO L93 Difference]: Finished difference Result 349 states and 537 transitions. [2018-11-18 14:59:07,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:59:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,685 INFO L225 Difference]: With dead ends: 349 [2018-11-18 14:59:07,685 INFO L226 Difference]: Without dead ends: 347 [2018-11-18 14:59:07,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-18 14:59:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 273. [2018-11-18 14:59:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-18 14:59:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 407 transitions. [2018-11-18 14:59:07,692 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 407 transitions. Word has length 21 [2018-11-18 14:59:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,692 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 407 transitions. [2018-11-18 14:59:07,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 407 transitions. [2018-11-18 14:59:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:59:07,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,693 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash 394079147, now seen corresponding path program 1 times [2018-11-18 14:59:07,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,724 INFO L87 Difference]: Start difference. First operand 273 states and 407 transitions. Second operand 3 states. [2018-11-18 14:59:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,738 INFO L93 Difference]: Finished difference Result 629 states and 937 transitions. [2018-11-18 14:59:07,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:59:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,739 INFO L225 Difference]: With dead ends: 629 [2018-11-18 14:59:07,739 INFO L226 Difference]: Without dead ends: 371 [2018-11-18 14:59:07,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-18 14:59:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2018-11-18 14:59:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-18 14:59:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 535 transitions. [2018-11-18 14:59:07,747 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 535 transitions. Word has length 21 [2018-11-18 14:59:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,748 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 535 transitions. [2018-11-18 14:59:07,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 535 transitions. [2018-11-18 14:59:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 14:59:07,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,749 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1369297533, now seen corresponding path program 1 times [2018-11-18 14:59:07,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,769 INFO L87 Difference]: Start difference. First operand 369 states and 535 transitions. Second operand 3 states. [2018-11-18 14:59:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,779 INFO L93 Difference]: Finished difference Result 553 states and 797 transitions. [2018-11-18 14:59:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 14:59:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,781 INFO L225 Difference]: With dead ends: 553 [2018-11-18 14:59:07,781 INFO L226 Difference]: Without dead ends: 379 [2018-11-18 14:59:07,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-18 14:59:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2018-11-18 14:59:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-18 14:59:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 535 transitions. [2018-11-18 14:59:07,790 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 535 transitions. Word has length 22 [2018-11-18 14:59:07,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,790 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 535 transitions. [2018-11-18 14:59:07,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 535 transitions. [2018-11-18 14:59:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 14:59:07,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,791 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,791 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash -668232955, now seen corresponding path program 1 times [2018-11-18 14:59:07,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,805 INFO L87 Difference]: Start difference. First operand 377 states and 535 transitions. Second operand 3 states. [2018-11-18 14:59:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,821 INFO L93 Difference]: Finished difference Result 1069 states and 1497 transitions. [2018-11-18 14:59:07,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 14:59:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,824 INFO L225 Difference]: With dead ends: 1069 [2018-11-18 14:59:07,824 INFO L226 Difference]: Without dead ends: 715 [2018-11-18 14:59:07,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-18 14:59:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-11-18 14:59:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 14:59:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 967 transitions. [2018-11-18 14:59:07,846 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 967 transitions. Word has length 22 [2018-11-18 14:59:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,846 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 967 transitions. [2018-11-18 14:59:07,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 967 transitions. [2018-11-18 14:59:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 14:59:07,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,849 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash -275205945, now seen corresponding path program 1 times [2018-11-18 14:59:07,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,877 INFO L87 Difference]: Start difference. First operand 713 states and 967 transitions. Second operand 3 states. [2018-11-18 14:59:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:07,913 INFO L93 Difference]: Finished difference Result 829 states and 1145 transitions. [2018-11-18 14:59:07,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:07,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 14:59:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:07,916 INFO L225 Difference]: With dead ends: 829 [2018-11-18 14:59:07,916 INFO L226 Difference]: Without dead ends: 827 [2018-11-18 14:59:07,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-18 14:59:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 713. [2018-11-18 14:59:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 14:59:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 951 transitions. [2018-11-18 14:59:07,939 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 951 transitions. Word has length 22 [2018-11-18 14:59:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:07,940 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 951 transitions. [2018-11-18 14:59:07,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 951 transitions. [2018-11-18 14:59:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 14:59:07,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:07,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:07,941 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:07,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash 759830592, now seen corresponding path program 1 times [2018-11-18 14:59:07,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:07,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:07,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:07,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:07,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:07,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:07,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:07,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:07,967 INFO L87 Difference]: Start difference. First operand 713 states and 951 transitions. Second operand 3 states. [2018-11-18 14:59:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:08,001 INFO L93 Difference]: Finished difference Result 1213 states and 1625 transitions. [2018-11-18 14:59:08,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:08,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 14:59:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:08,004 INFO L225 Difference]: With dead ends: 1213 [2018-11-18 14:59:08,004 INFO L226 Difference]: Without dead ends: 1211 [2018-11-18 14:59:08,005 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-18 14:59:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1049. [2018-11-18 14:59:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-11-18 14:59:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1367 transitions. [2018-11-18 14:59:08,037 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1367 transitions. Word has length 23 [2018-11-18 14:59:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:08,037 INFO L480 AbstractCegarLoop]: Abstraction has 1049 states and 1367 transitions. [2018-11-18 14:59:08,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1367 transitions. [2018-11-18 14:59:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 14:59:08,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:08,039 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:08,040 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:08,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:08,040 INFO L82 PathProgramCache]: Analyzing trace with hash 366803582, now seen corresponding path program 1 times [2018-11-18 14:59:08,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:08,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:08,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:08,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:08,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:08,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,069 INFO L87 Difference]: Start difference. First operand 1049 states and 1367 transitions. Second operand 3 states. [2018-11-18 14:59:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:08,119 INFO L93 Difference]: Finished difference Result 2397 states and 3097 transitions. [2018-11-18 14:59:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:08,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 14:59:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:08,123 INFO L225 Difference]: With dead ends: 2397 [2018-11-18 14:59:08,123 INFO L226 Difference]: Without dead ends: 1371 [2018-11-18 14:59:08,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-11-18 14:59:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2018-11-18 14:59:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-18 14:59:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1703 transitions. [2018-11-18 14:59:08,169 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1703 transitions. Word has length 23 [2018-11-18 14:59:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:08,169 INFO L480 AbstractCegarLoop]: Abstraction has 1369 states and 1703 transitions. [2018-11-18 14:59:08,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1703 transitions. [2018-11-18 14:59:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 14:59:08,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:08,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:08,172 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:08,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:08,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2080127930, now seen corresponding path program 1 times [2018-11-18 14:59:08,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:08,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:08,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:08,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:08,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,186 INFO L87 Difference]: Start difference. First operand 1369 states and 1703 transitions. Second operand 3 states. [2018-11-18 14:59:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:08,230 INFO L93 Difference]: Finished difference Result 2077 states and 2585 transitions. [2018-11-18 14:59:08,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:08,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 14:59:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:08,234 INFO L225 Difference]: With dead ends: 2077 [2018-11-18 14:59:08,234 INFO L226 Difference]: Without dead ends: 1419 [2018-11-18 14:59:08,235 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-11-18 14:59:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1417. [2018-11-18 14:59:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2018-11-18 14:59:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1735 transitions. [2018-11-18 14:59:08,284 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1735 transitions. Word has length 24 [2018-11-18 14:59:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:08,284 INFO L480 AbstractCegarLoop]: Abstraction has 1417 states and 1735 transitions. [2018-11-18 14:59:08,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1735 transitions. [2018-11-18 14:59:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 14:59:08,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:08,286 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:08,287 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:08,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1513774788, now seen corresponding path program 1 times [2018-11-18 14:59:08,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:08,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:08,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:08,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:08,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:08,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:08,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:08,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,306 INFO L87 Difference]: Start difference. First operand 1417 states and 1735 transitions. Second operand 3 states. [2018-11-18 14:59:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:08,386 INFO L93 Difference]: Finished difference Result 2315 states and 2792 transitions. [2018-11-18 14:59:08,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:08,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 14:59:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:08,392 INFO L225 Difference]: With dead ends: 2315 [2018-11-18 14:59:08,392 INFO L226 Difference]: Without dead ends: 2313 [2018-11-18 14:59:08,393 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2018-11-18 14:59:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2121. [2018-11-18 14:59:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2018-11-18 14:59:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2535 transitions. [2018-11-18 14:59:08,446 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2535 transitions. Word has length 24 [2018-11-18 14:59:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:08,446 INFO L480 AbstractCegarLoop]: Abstraction has 2121 states and 2535 transitions. [2018-11-18 14:59:08,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2535 transitions. [2018-11-18 14:59:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 14:59:08,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:08,449 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:08,449 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:08,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1906801798, now seen corresponding path program 1 times [2018-11-18 14:59:08,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:59:08,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:59:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:59:08,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:08,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:59:08,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:59:08,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:59:08,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,461 INFO L87 Difference]: Start difference. First operand 2121 states and 2535 transitions. Second operand 3 states. [2018-11-18 14:59:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:08,535 INFO L93 Difference]: Finished difference Result 4745 states and 5543 transitions. [2018-11-18 14:59:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:59:08,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 14:59:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:08,536 INFO L225 Difference]: With dead ends: 4745 [2018-11-18 14:59:08,536 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:59:08,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:59:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:59:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:59:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:59:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:59:08,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-18 14:59:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:08,541 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:59:08,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:59:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:59:08,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:59:08,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:59:08,567 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 14:59:08,567 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:59:08,567 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:59:08,567 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 14:59:08,567 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,568 INFO L428 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-18 14:59:08,568 INFO L421 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-11-18 14:59:08,568 INFO L425 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,569 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,569 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,569 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-11-18 14:59:08,569 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,569 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,571 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-18 14:59:08,571 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,571 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,571 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-11-18 14:59:08,571 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-18 14:59:08,571 INFO L425 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-18 14:59:08,572 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,572 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,572 INFO L425 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,572 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-18 14:59:08,572 INFO L425 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,572 INFO L428 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-11-18 14:59:08,572 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-18 14:59:08,572 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,572 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 14:59:08,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:59:08 BoogieIcfgContainer [2018-11-18 14:59:08,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:59:08,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:59:08,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:59:08,579 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:59:08,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:06" (3/4) ... [2018-11-18 14:59:08,582 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:59:08,587 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:59:08,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:59:08,591 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 14:59:08,591 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 14:59:08,592 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 14:59:08,632 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f88c138f-69fd-4ad8-a469-3a7ad5c76d45/bin-2019/uautomizer/witness.graphml [2018-11-18 14:59:08,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:59:08,632 INFO L168 Benchmark]: Toolchain (without parser) took 2171.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -101.3 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:08,633 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:59:08,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:08,634 INFO L168 Benchmark]: Boogie Preprocessor took 21.96 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:08,634 INFO L168 Benchmark]: RCFGBuilder took 274.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:08,634 INFO L168 Benchmark]: TraceAbstraction took 1665.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:08,635 INFO L168 Benchmark]: Witness Printer took 52.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:08,636 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.96 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 274.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1665.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * Witness Printer took 52.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 36 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1222 SDtfs, 563 SDslu, 809 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2121occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 655 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 14032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...