./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_6_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_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:43:59,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:43:59,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:43:59,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:43:59,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:43:59,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:43:59,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:43:59,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:43:59,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:43:59,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:43:59,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:43:59,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:43:59,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:43:59,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:43:59,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:43:59,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:43:59,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:43:59,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:43:59,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:43:59,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:43:59,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:43:59,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:43:59,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:43:59,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:43:59,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:43:59,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:43:59,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:43:59,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:43:59,440 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:43:59,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:43:59,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:43:59,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:43:59,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:43:59,442 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:43:59,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:43:59,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:43:59,443 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 14:43:59,452 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:43:59,452 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:43:59,453 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:43:59,453 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 14:43:59,454 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:43:59,454 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:43:59,454 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:43:59,454 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:43:59,454 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:43:59,454 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:43:59,454 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:43:59,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:43:59,455 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:43:59,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:43:59,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:43:59,455 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:43:59,455 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:43:59,455 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:43:59,456 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:43:59,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:43:59,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:43:59,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:43:59,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:43:59,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:43:59,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:43:59,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:43:59,457 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:43:59,457 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:43:59,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:43:59,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:43:59,457 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_eb97c574-7f87-4a74-9d7f-eafa812fc15d/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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-11-18 14:43:59,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:43:59,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:43:59,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:43:59,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:43:59,496 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:43:59,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:43:59,543 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/data/c548dab68/dc844df14ab94d71a43869d21f86f1b2/FLAGd9874191a [2018-11-18 14:43:59,952 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:43:59,952 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:43:59,958 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/data/c548dab68/dc844df14ab94d71a43869d21f86f1b2/FLAGd9874191a [2018-11-18 14:43:59,966 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/data/c548dab68/dc844df14ab94d71a43869d21f86f1b2 [2018-11-18 14:43:59,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:43:59,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 14:43:59,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:43:59,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:43:59,972 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:43:59,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:43:59" (1/1) ... [2018-11-18 14:43:59,975 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:43:59, skipping insertion in model container [2018-11-18 14:43:59,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:43:59" (1/1) ... [2018-11-18 14:43:59,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:43:59,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:44:00,111 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:44:00,113 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:44:00,127 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:44:00,138 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:44:00,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00 WrapperNode [2018-11-18 14:44:00,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:44:00,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:44:00,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:44:00,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:44:00,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (1/1) ... [2018-11-18 14:44:00,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (1/1) ... [2018-11-18 14:44:00,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (1/1) ... [2018-11-18 14:44:00,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (1/1) ... [2018-11-18 14:44:00,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (1/1) ... [2018-11-18 14:44:00,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (1/1) ... [2018-11-18 14:44:00,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (1/1) ... [2018-11-18 14:44:00,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:44:00,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:44:00,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:44:00,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:44:00,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/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:44:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:44:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:44:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:44:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 14:44:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 14:44:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:44:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:44:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:44:00,351 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:44:00,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:44:00 BoogieIcfgContainer [2018-11-18 14:44:00,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:44:00,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:44:00,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:44:00,354 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:44:00,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:43:59" (1/3) ... [2018-11-18 14:44:00,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1fc1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:44:00, skipping insertion in model container [2018-11-18 14:44:00,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:44:00" (2/3) ... [2018-11-18 14:44:00,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1fc1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:44:00, skipping insertion in model container [2018-11-18 14:44:00,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:44:00" (3/3) ... [2018-11-18 14:44:00,357 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:44:00,364 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:44:00,368 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:44:00,376 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:44:00,393 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:44:00,394 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:44:00,394 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:44:00,394 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:44:00,394 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:44:00,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:44:00,394 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:44:00,395 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:44:00,395 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:44:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 14:44:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 14:44:00,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:44:00,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1169713633, now seen corresponding path program 1 times [2018-11-18 14:44:00,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:00,521 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:44:00,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:00,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:00,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:00,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:00,534 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-11-18 14:44:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:00,573 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2018-11-18 14:44:00,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:00,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 14:44:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:00,583 INFO L225 Difference]: With dead ends: 65 [2018-11-18 14:44:00,583 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 14:44:00,586 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:44:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 14:44:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-18 14:44:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 14:44:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2018-11-18 14:44:00,610 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2018-11-18 14:44:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:00,611 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2018-11-18 14:44:00,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2018-11-18 14:44:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 14:44:00,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:44:00,612 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1849772003, now seen corresponding path program 1 times [2018-11-18 14:44:00,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:00,656 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:44:00,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:00,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:00,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:00,658 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 3 states. [2018-11-18 14:44:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:00,676 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2018-11-18 14:44:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:00,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 14:44:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:00,677 INFO L225 Difference]: With dead ends: 80 [2018-11-18 14:44:00,677 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 14:44:00,677 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:44:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 14:44:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-18 14:44:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 14:44:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 79 transitions. [2018-11-18 14:44:00,682 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 79 transitions. Word has length 17 [2018-11-18 14:44:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:00,682 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 79 transitions. [2018-11-18 14:44:00,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2018-11-18 14:44:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 14:44:00,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,683 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:44:00,683 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1901598932, now seen corresponding path program 1 times [2018-11-18 14:44:00,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:00,710 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:44:00,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:00,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:00,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:00,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:00,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:00,711 INFO L87 Difference]: Start difference. First operand 48 states and 79 transitions. Second operand 3 states. [2018-11-18 14:44:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:00,726 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2018-11-18 14:44:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:00,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 14:44:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:00,727 INFO L225 Difference]: With dead ends: 76 [2018-11-18 14:44:00,727 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 14:44:00,728 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:44:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 14:44:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-18 14:44:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 14:44:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2018-11-18 14:44:00,731 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 82 transitions. Word has length 18 [2018-11-18 14:44:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:00,732 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 82 transitions. [2018-11-18 14:44:00,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 82 transitions. [2018-11-18 14:44:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 14:44:00,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,732 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:44:00,732 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1508571922, now seen corresponding path program 1 times [2018-11-18 14:44:00,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:00,757 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:44:00,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:00,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:00,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:00,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:00,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:00,758 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. Second operand 3 states. [2018-11-18 14:44:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:00,777 INFO L93 Difference]: Finished difference Result 93 states and 149 transitions. [2018-11-18 14:44:00,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:00,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 14:44:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:00,778 INFO L225 Difference]: With dead ends: 93 [2018-11-18 14:44:00,778 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 14:44:00,778 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:44:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 14:44:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-11-18 14:44:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 14:44:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2018-11-18 14:44:00,785 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 18 [2018-11-18 14:44:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:00,785 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2018-11-18 14:44:00,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2018-11-18 14:44:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 14:44:00,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,786 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:44:00,786 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2106337004, now seen corresponding path program 1 times [2018-11-18 14:44:00,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:00,825 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:44:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:00,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:00,826 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand 3 states. [2018-11-18 14:44:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:00,840 INFO L93 Difference]: Finished difference Result 151 states and 245 transitions. [2018-11-18 14:44:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:00,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 14:44:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:00,841 INFO L225 Difference]: With dead ends: 151 [2018-11-18 14:44:00,841 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 14:44:00,841 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:44:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 14:44:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-18 14:44:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 14:44:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2018-11-18 14:44:00,846 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 18 [2018-11-18 14:44:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:00,846 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2018-11-18 14:44:00,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2018-11-18 14:44:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:44:00,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,847 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:44:00,847 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash -478695656, now seen corresponding path program 1 times [2018-11-18 14:44:00,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:00,865 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:44:00,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:00,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:00,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:00,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:00,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:00,866 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand 3 states. [2018-11-18 14:44:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:00,878 INFO L93 Difference]: Finished difference Result 136 states and 212 transitions. [2018-11-18 14:44:00,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:00,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:44:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:00,880 INFO L225 Difference]: With dead ends: 136 [2018-11-18 14:44:00,880 INFO L226 Difference]: Without dead ends: 95 [2018-11-18 14:44:00,880 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:44:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-18 14:44:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-18 14:44:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 14:44:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2018-11-18 14:44:00,889 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 19 [2018-11-18 14:44:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:00,890 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2018-11-18 14:44:00,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2018-11-18 14:44:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:44:00,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,891 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:44:00,891 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash -871722666, now seen corresponding path program 1 times [2018-11-18 14:44:00,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:00,911 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:44:00,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:00,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:00,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:00,912 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand 3 states. [2018-11-18 14:44:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:00,925 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2018-11-18 14:44:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:00,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:44:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:00,926 INFO L225 Difference]: With dead ends: 165 [2018-11-18 14:44:00,926 INFO L226 Difference]: Without dead ends: 163 [2018-11-18 14:44:00,926 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:44:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-18 14:44:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2018-11-18 14:44:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 14:44:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2018-11-18 14:44:00,933 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 19 [2018-11-18 14:44:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:00,933 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2018-11-18 14:44:00,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2018-11-18 14:44:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:44:00,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,934 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:44:00,934 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,934 INFO L82 PathProgramCache]: Analyzing trace with hash -191664296, now seen corresponding path program 1 times [2018-11-18 14:44:00,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:00,962 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:44:00,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:00,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:00,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:00,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:00,963 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand 3 states. [2018-11-18 14:44:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:00,985 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2018-11-18 14:44:00,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:00,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:44:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:00,986 INFO L225 Difference]: With dead ends: 285 [2018-11-18 14:44:00,986 INFO L226 Difference]: Without dead ends: 171 [2018-11-18 14:44:00,987 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:44:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-18 14:44:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-11-18 14:44:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-18 14:44:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2018-11-18 14:44:00,997 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 19 [2018-11-18 14:44:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:00,997 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2018-11-18 14:44:00,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2018-11-18 14:44:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:44:00,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:00,998 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:44:00,998 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:00,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:00,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1253383511, now seen corresponding path program 1 times [2018-11-18 14:44:00,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:00,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:00,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:00,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:00,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:01,021 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:44:01,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:01,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:01,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:01,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:01,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:01,022 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 3 states. [2018-11-18 14:44:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:01,041 INFO L93 Difference]: Finished difference Result 253 states and 373 transitions. [2018-11-18 14:44:01,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:01,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:44:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:01,042 INFO L225 Difference]: With dead ends: 253 [2018-11-18 14:44:01,042 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 14:44:01,043 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:44:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 14:44:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-11-18 14:44:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 14:44:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 251 transitions. [2018-11-18 14:44:01,051 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 251 transitions. Word has length 20 [2018-11-18 14:44:01,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:01,051 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 251 transitions. [2018-11-18 14:44:01,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 251 transitions. [2018-11-18 14:44:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:44:01,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:01,052 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:44:01,053 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:01,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1646410521, now seen corresponding path program 1 times [2018-11-18 14:44:01,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:01,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:01,081 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:44:01,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:01,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:01,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:01,082 INFO L87 Difference]: Start difference. First operand 173 states and 251 transitions. Second operand 3 states. [2018-11-18 14:44:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:01,093 INFO L93 Difference]: Finished difference Result 301 states and 441 transitions. [2018-11-18 14:44:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:01,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:44:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:01,095 INFO L225 Difference]: With dead ends: 301 [2018-11-18 14:44:01,095 INFO L226 Difference]: Without dead ends: 299 [2018-11-18 14:44:01,095 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:44:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-18 14:44:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 241. [2018-11-18 14:44:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-18 14:44:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 343 transitions. [2018-11-18 14:44:01,106 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 343 transitions. Word has length 20 [2018-11-18 14:44:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:01,107 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 343 transitions. [2018-11-18 14:44:01,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 343 transitions. [2018-11-18 14:44:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:44:01,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:01,108 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:44:01,108 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:01,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash -966352151, now seen corresponding path program 1 times [2018-11-18 14:44:01,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:01,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:01,121 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:44:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:01,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:01,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:01,122 INFO L87 Difference]: Start difference. First operand 241 states and 343 transitions. Second operand 3 states. [2018-11-18 14:44:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:01,137 INFO L93 Difference]: Finished difference Result 549 states and 777 transitions. [2018-11-18 14:44:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:01,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:44:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:01,139 INFO L225 Difference]: With dead ends: 549 [2018-11-18 14:44:01,139 INFO L226 Difference]: Without dead ends: 323 [2018-11-18 14:44:01,140 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:44:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-18 14:44:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-11-18 14:44:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 14:44:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 439 transitions. [2018-11-18 14:44:01,150 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 439 transitions. Word has length 20 [2018-11-18 14:44:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:01,150 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 439 transitions. [2018-11-18 14:44:01,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 439 transitions. [2018-11-18 14:44:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:44:01,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:01,151 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:44:01,151 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:01,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:01,152 INFO L82 PathProgramCache]: Analyzing trace with hash 501097101, now seen corresponding path program 1 times [2018-11-18 14:44:01,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:01,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:01,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:01,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:01,169 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:44:01,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:01,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:01,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:01,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:01,170 INFO L87 Difference]: Start difference. First operand 321 states and 439 transitions. Second operand 3 states. [2018-11-18 14:44:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:01,185 INFO L93 Difference]: Finished difference Result 481 states and 653 transitions. [2018-11-18 14:44:01,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:01,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:44:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:01,186 INFO L225 Difference]: With dead ends: 481 [2018-11-18 14:44:01,186 INFO L226 Difference]: Without dead ends: 331 [2018-11-18 14:44:01,187 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:44:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-18 14:44:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-11-18 14:44:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-18 14:44:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 439 transitions. [2018-11-18 14:44:01,198 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 439 transitions. Word has length 21 [2018-11-18 14:44:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:01,198 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 439 transitions. [2018-11-18 14:44:01,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 439 transitions. [2018-11-18 14:44:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:44:01,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:01,199 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:44:01,199 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:01,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash 108070091, now seen corresponding path program 1 times [2018-11-18 14:44:01,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:01,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:01,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:01,218 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:44:01,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:01,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:01,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:01,219 INFO L87 Difference]: Start difference. First operand 329 states and 439 transitions. Second operand 3 states. [2018-11-18 14:44:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:01,250 INFO L93 Difference]: Finished difference Result 925 states and 1209 transitions. [2018-11-18 14:44:01,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:01,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:44:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:01,252 INFO L225 Difference]: With dead ends: 925 [2018-11-18 14:44:01,253 INFO L226 Difference]: Without dead ends: 619 [2018-11-18 14:44:01,253 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:44:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-18 14:44:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-11-18 14:44:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 14:44:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 775 transitions. [2018-11-18 14:44:01,266 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 775 transitions. Word has length 21 [2018-11-18 14:44:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:01,267 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 775 transitions. [2018-11-18 14:44:01,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 775 transitions. [2018-11-18 14:44:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:44:01,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:01,268 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:44:01,268 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:01,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:01,268 INFO L82 PathProgramCache]: Analyzing trace with hash -571988279, now seen corresponding path program 1 times [2018-11-18 14:44:01,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:01,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:01,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:01,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:01,281 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:44:01,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:01,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:01,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:01,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:01,282 INFO L87 Difference]: Start difference. First operand 617 states and 775 transitions. Second operand 3 states. [2018-11-18 14:44:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:01,307 INFO L93 Difference]: Finished difference Result 701 states and 889 transitions. [2018-11-18 14:44:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:01,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:44:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:01,309 INFO L225 Difference]: With dead ends: 701 [2018-11-18 14:44:01,310 INFO L226 Difference]: Without dead ends: 699 [2018-11-18 14:44:01,310 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:44:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-11-18 14:44:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 617. [2018-11-18 14:44:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 14:44:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 759 transitions. [2018-11-18 14:44:01,332 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 759 transitions. Word has length 21 [2018-11-18 14:44:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:01,333 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 759 transitions. [2018-11-18 14:44:01,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 759 transitions. [2018-11-18 14:44:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 14:44:01,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:01,334 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:44:01,334 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:01,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash -944578434, now seen corresponding path program 1 times [2018-11-18 14:44:01,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:01,357 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:44:01,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:01,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:01,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:01,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:01,359 INFO L87 Difference]: Start difference. First operand 617 states and 759 transitions. Second operand 3 states. [2018-11-18 14:44:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:01,400 INFO L93 Difference]: Finished difference Result 1019 states and 1240 transitions. [2018-11-18 14:44:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:01,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 14:44:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:01,403 INFO L225 Difference]: With dead ends: 1019 [2018-11-18 14:44:01,403 INFO L226 Difference]: Without dead ends: 1017 [2018-11-18 14:44:01,404 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:44:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-11-18 14:44:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 921. [2018-11-18 14:44:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-11-18 14:44:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1111 transitions. [2018-11-18 14:44:01,432 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1111 transitions. Word has length 22 [2018-11-18 14:44:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:01,433 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1111 transitions. [2018-11-18 14:44:01,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1111 transitions. [2018-11-18 14:44:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 14:44:01,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:44:01,435 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:44:01,435 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:44:01,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:44:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash -264520064, now seen corresponding path program 1 times [2018-11-18 14:44:01,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:44:01,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:44:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:44:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:44:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:44:01,458 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:44:01,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:44:01,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:44:01,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:44:01,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:44:01,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:44:01,459 INFO L87 Difference]: Start difference. First operand 921 states and 1111 transitions. Second operand 3 states. [2018-11-18 14:44:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:44:01,511 INFO L93 Difference]: Finished difference Result 2073 states and 2455 transitions. [2018-11-18 14:44:01,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:44:01,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 14:44:01,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:44:01,512 INFO L225 Difference]: With dead ends: 2073 [2018-11-18 14:44:01,512 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:44:01,514 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:44:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:44:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:44:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:44:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:44:01,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-11-18 14:44:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:44:01,515 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:44:01,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:44:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:44:01,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:44:01,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:44:01,542 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 14:44:01,542 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:44:01,542 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:44:01,543 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 14:44:01,543 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:44:01,543 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:44:01,543 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-18 14:44:01,543 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,543 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-11-18 14:44:01,543 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,543 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-18 14:44:01,543 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-18 14:44:01,543 INFO L428 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-11-18 14:44:01,543 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,544 INFO L428 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-11-18 14:44:01,544 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-18 14:44:01,545 INFO L425 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-18 14:44:01,545 INFO L421 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-11-18 14:44:01,545 INFO L425 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,545 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,545 INFO L425 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,545 INFO L425 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-18 14:44:01,545 INFO L425 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,545 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 14:44:01,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:44:01 BoogieIcfgContainer [2018-11-18 14:44:01,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:44:01,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:44:01,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:44:01,552 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:44:01,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:44:00" (3/4) ... [2018-11-18 14:44:01,558 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:44:01,564 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:44:01,565 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:44:01,568 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 14:44:01,568 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 14:44:01,569 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 14:44:01,612 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eb97c574-7f87-4a74-9d7f-eafa812fc15d/bin-2019/uautomizer/witness.graphml [2018-11-18 14:44:01,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:44:01,613 INFO L168 Benchmark]: Toolchain (without parser) took 1645.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 959.1 MB in the beginning and 905.0 MB in the end (delta: 54.2 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:44:01,614 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:44:01,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.55 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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:44:01,615 INFO L168 Benchmark]: Boogie Preprocessor took 18.78 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 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:44:01,615 INFO L168 Benchmark]: RCFGBuilder took 193.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:44:01,615 INFO L168 Benchmark]: TraceAbstraction took 1198.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 908.4 MB in the end (delta: 191.8 MB). Peak memory consumption was 191.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:44:01,615 INFO L168 Benchmark]: Witness Printer took 61.04 ms. Allocated memory is still 1.2 GB. Free memory was 908.4 MB in the beginning and 905.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:44:01,617 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.55 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.78 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1198.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 908.4 MB in the end (delta: 191.8 MB). Peak memory consumption was 191.8 MB. Max. memory is 11.5 GB. * Witness Printer took 61.04 ms. Allocated memory is still 1.2 GB. Free memory was 908.4 MB in the beginning and 905.0 MB 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: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 1.1s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 907 SDtfs, 408 SDslu, 595 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=15, 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 331 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 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.2s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 9734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...